38 resultados para Global localization problem
em Universidade do Minho
Resumo:
Positioning technologies are becoming ubiquitous and are being used more and more frequently for supporting a large variety of applica- tions. For outdoor applications, global navigation satellite systems (GNSSs), such as the global positioning system (GPS), are the most common and popular choice because of their wide coverage. GPS is also augmented with network-based systems that exploit existing wireless and mobile networks for providing positioning functions where GPS is not available or to save energy in battery-powered devices. Indoors, GNSSs are not a viable solution, but many applications require very accurate, fast, and exible positioning, tracking, and navigation functions. These and other requirements have stim- ulated research activities, in both industry and academia, where a variety of fundamental principles, techniques, and sensors are being integrated to provide positioning functions to many applications. The large majority of positioning technologies is for indoor environments, and most of the existing commercial products have been developed for use in of ce buildings, airports, shopping malls, factory plants, and similar spaces. There are, however, other spaces where positioning, tracking, and navigation systems play a central role in safety and in rescue operations, as well as in supporting speci c activities or for scienti c research activities in other elds. Among those spaces are underground tunnels, mines, and even underwater wells and caves. This chapter describes the research efforts over the past few years that have been put into the development of positioning systems for underground tun- nels, with particular emphasis in the case of the Large Hadron Collider (LHC) at CERN (the European Organization for Nuclear Research), where localiza- tion aims at enabling more automatic and unmanned radiation surveys. Examples of positioning and localization systems that have been devel- oped in the past few years for underground facilities are presented in the fol- lowing section, together with a brief characterization of those spaces’ special conditions and the requirements of some of the most common applications. Section 5.2 provides a short overview of some of the most representative research efforts that are currently being carried out by many research teams around the world. In addition, some of the fundamental principles and tech- niques are identi ed, such as the use of leaky coaxial cables, as used at the LHC. In Section 5.3, we introduce the speci c environment of the LHC and de ne the positioning requirements for the envisaged application. This is followed by a detailed description of our approach and the results that have been achieved so far. Some last comments and remarks are presented in a nal section.
Resumo:
Dissertação de Mestrado em Engenharia Informática
Resumo:
In this paper a comparison between using global and local optimization techniques for solving the problem of generating human-like arm and hand movements for an anthropomorphic dual arm robot is made. Although the objective function involved in each optimization problem is convex, there is no evidence that the admissible regions of these problems are convex sets. For the sequence of movements for which the numerical tests were done there were no significant differences between the optimal solutions obtained using the global and the local techniques. This suggests that the optimal solution obtained using the local solver is indeed a global solution.
Resumo:
The Electromagnetism-like (EM) algorithm is a population- based stochastic global optimization algorithm that uses an attraction- repulsion mechanism to move sample points towards the optimal. In this paper, an implementation of the EM algorithm in the Matlab en- vironment as a useful function for practitioners and for those who want to experiment a new global optimization solver is proposed. A set of benchmark problems are solved in order to evaluate the performance of the implemented method when compared with other stochastic methods available in the Matlab environment. The results con rm that our imple- mentation is a competitive alternative both in term of numerical results and performance. Finally, a case study based on a parameter estimation problem of a biology system shows that the EM implementation could be applied with promising results in the control optimization area.
Resumo:
Autor proof
Resumo:
This work presents an improved model to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving Orienteering Problems is presented, and this heuristic provides good results in terms of accuracy and computation time. Euclidean instances as well as asymmetric real data gathered from Google maps were used, and the model has a promising performance mainly with asymmetric cost matrices.
Resumo:
This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.
Resumo:
The selective collection of municipal solid waste for recycling is a very complex and expensive process, where a major issue is to perform cost-efficient waste collection routes. Despite the abundance of commercially available software for fleet management, they often lack the capability to deal properly with sequencing problems and dynamic revision of plans and schedules during process execution. Our approach to achieve better solutions for the waste collection process is to model it as a vehicle routing problem, more specifically as a team orienteering problem where capacity constraints on the vehicles are considered, as well as time windows for the waste collection points and for the vehicles. The final model is called capacitated team orienteering problem with double time windows (CTOPdTW).We developed a genetic algorithm to solve routing problems in waste collection modelled as a CTOPdTW. The results achieved suggest possible reductions of logistic costs in selective waste collection.
Resumo:
To solve a health and safety problem on a waste treatment facility, different multicriteria decision methods were used, including the PROV Exponential decision method. Four alternatives and ten attributes were considered. We found a congruent solution, validated by the different methods. The AHP and the PROV Exponential decision method led us to the same options ordering, but the last method reinforced one of the options as being the best performing one, and detached the least performing option. Also, the ELECTRE I method results led to the same ordering which allowed to point the best solution with reasonable confidence. This paper demonstrates the potential of using multicriteria decision methods to support decision making on complex problems such as risk control and accidents prevention.
Resumo:
Earthworks involve the levelling or shaping of a target area through the moving or processing of the ground surface. Most construction projects require earthworks, which are heavily dependent on mechanical equipment (e.g., excavators, trucks and compactors). Often, earthworks are the most costly and time-consuming component of infrastructure constructions (e.g., road, railway and airports) and current pressure for higher productivity and safety highlights the need to optimize earthworks, which is a nontrivial task. Most previous attempts at tackling this problem focus on single-objective optimization of partial processes or aspects of earthworks, overlooking the advantages of a multi-objective and global optimization. This work describes a novel optimization system based on an evolutionary multi-objective approach, capable of globally optimizing several objectives simultaneously and dynamically. The proposed system views an earthwork construction as a production line, where the goal is to optimize resources under two crucial criteria (costs and duration) and focus the evolutionary search (non-dominated sorting genetic algorithm-II) on compaction allocation, using linear programming to distribute the remaining equipment (e.g., excavators). Several experiments were held using real-world data from a Portuguese construction site, showing that the proposed system is quite competitive when compared with current manual earthwork equipment allocation.
Resumo:
Human activity is very dynamic and subtle, and most physical environments are also highly dynamic and support a vast range of social practices that do not map directly into any immediate ubiquitous computing functionally. Identifying what is valuable to people is very hard and obviously leads to great uncertainty regarding the type of support needed and the type of resources needed to create such support. We have addressed the issues of system development through the adoption of a Crowdsourced software development model [13]. We have designed and developed Anywhere places, an open and flexible system support infrastructure for Ubiquitous Computing that is based on a balanced combination between global services and applications and situated devices. Evaluation, however, is still an open problem. The characteristics of ubiquitous computing environments make their evaluation very complex: there are no globally accepted metrics and it is very difficult to evaluate large-scale and long-term environments in real contexts. In this paper, we describe a first proposal of an hybrid 3D simulated prototype of Anywhere places that combines simulated and real components to generate a mixed reality which can be used to assess the envisaged ubiquitous computing environments [17].
Resumo:
Dissertação de Mestrado em Engenharia Informática
Resumo:
Tese de Doutoramento - Leaders for Technical Industries (LTI) - MIT Portugal
Resumo:
Tese de Doutoramento Programa Doutoral em Engenharia Electrónica e Computadores
Resumo:
Programa Doutoral em Engenharia Industrial e de Sistemas.