In this thesis we study a new type of pursuit-evasion game, which we call the herding problem. Unlike typical pursuit evasion games where the pursuer aims to catch or intercept the evader, the goal of the pursuer in this game is to drive the evader to a certain location or region in the x-y plane. This herding model is proposed and represented using dynamic equations. The model is implemented in an effort to understand how two pursuers work cooperatively to drive multiple evaders to the desired destination following weighted time-optimal and effort-optimal control paths. Simulation of this herding problem is accomplished through dynamic programming by utilizing the SNOPT software in the MATLAB environment. The numerical solution gives us the optimal path for all agents and the corresponding controls as well as the relative distance and angle variables. The results show that the pursuers can work cooperatively to drive multiple evaders to the goal.

Message routing is a fundamental function of a network, and fault-tolerance is an important tool to ensure the quality of service of a network. Assume that network contain only one faulty element. In order to ensure the message can be arrived. We present a fault-tolerant message routing algorithm which being the secondary path, as the optimal path can't be connected in the double-loop networks.

The use of autonomous underwater vehicles (AUVs) for oceanic observation and research is becoming more common. Underwater gliders are a specific class of AUV that do not use conventional propulsion. Instead they change their buoyancy and center of mass location to control attitude and trajectory. The vehicles spend most of their time in long, steady glides, so even minor improvements in glide range can be magnified over multiple dives. This dissertation presents a rigid-body dynamic system for a generic vehicle operating in a moving fluid (ocean current or wind). The model is then reduced to apply to underwater gliders. A reduced-order point-mass model is analyzed for optimal gliding in the presence of a current. Different numerical method solutions are compared while attempting to achieve maximum glide range. The result, although approximate, provides good insight into how the vehicles may be operated more effectively. At the end of each dive, the gliders must change their buoyancy and pitch to transition to a climb. Improper scheduling of the buoyancy and pitch change may cause the vehicle to stall and lose directional stability. Optimal control theory is applied to the buoyancy and angle of attack scheduling of a point-mass model. A rigid-body model is analyzed on a singular arc steady glide. An analytical solution for the control required to stay on the arc is calculated. The model is linearized to calculate possible perturbation directions while remaining on the arc. The nonlinear model is then propagated in forward and reverse time with the perturbations and analyzed. Lastly, one of the numerical solutions is analyzed using the singular arc equations for verification. This work received support from the Office of Naval Research under Grant Number N00014-08-1-0012. / Ph. D.

Made available in DSpace on 2014-12-17T15:15:01Z (GMT). No. of bitstreams: 1 ThiagoCCN_DISSERT.pdf: 2332508 bytes, checksum: bbc84148d8aa1acc5070a5a68ca8b3b6 (MD5) Previous issue date: 2012-06-29 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / Following the study of Andrade et al. (2009) on regular square lattices, here we investigate the problem of optimal path cracks (OPC) in Complex Networks. In this problem we associate to each site a determined energy. The optimum path is defined as the one among all possible paths that crosses the system which has the minimum cost, namely the sum of the energies along the path. Once the optimum path is determined, at each step, one blocks its site with highest energy, and then a new optimal path is calculated. This procedure is repeated until there is a set of blocked sites forming a macroscopic fracture which connects the opposite sides of the system. The method is applied to a lattice of size L and the density of removed sites is computed. As observed in the work by Andrade et al. (2009), the fractured system studied here also presents different behaviors depending on the level of disorder, namely weak, moderated and strong disorder intensities. In the regime of weak and moderated disorder, while the density of removed sites in the system does not depend of the size L in the case of regular lattices, in the regime of high disorder the density becomes substantially dependent on L. We did the same type of study for Complex Networks. In this case, each new site is connected with m previous ones. As in the previous work, we observe that the density of removed sites presents a similar behavior. Moreover, a new result is obtained, i.e., we analyze the dependency of the disorder with the attachment parameter m / Seguindo a linha do trabalho de Andrade e colaboradores (2009) em redes regulares, n?s investigamos o problema da fratura atrav?s do caminho ?timo (optimal path cracks -OPC) em Redes Complexas. Neste problema n?s associamos para cada s?tio uma determinada energia. O caminho ?timo ? definido como aquele, dentre todos os poss?veis, que atravessa o sistema e tem o menor custo, ou seja, a menor soma das energias ao longo do caminho. Uma vez que o caminho ?timo ? determinado, em cada passo, n?s bloqueamos o s?tio com maior energia e a partir de ent?o um novo caminho ?timo ? calculado. Este procedimento ? repetido at? que existe um conjunto de s?tios bloqueados que forma uma fratura macrosc?pica a qual conecta lados opostos do sistema. O m?todo ? aplicado numa rede de lado L e a densidade de s?tios removidos ? computada. Como observado no trabalho de Andrade e colaboradores, o sistema fraturado que n?s estudamos tamb?m apresenta diferentes comportamentos dependendo do n?vel da desordem, que pode ser fraca, moderada ou forte. No regime de desordem fraca e moderada, a densidade de s?tios removidos no sistema n?o depende do tamanho L no caso de redes regulares, enquanto no regime de desordem forte a densidade se torna substancialmente dependente de L. N?s fizemos o mesmo tipo de estudo para Redes Complexas. Numa rede complexa caso, cada novo s?tio ? conectado a m s?tios que j? est?o presentes na rede. Como no trabalho anterior, n?s observamos que a densidade de s?tios removidos apresenta um comportamento similar. Al?m disso, um novo resultado ? obtido, isto ?, n?s analisamos a depend?ncia da desordem com o par?metro de liga??o m

Parking a vehicle can often lead to frustration, air pollution and congestion due to limited availability of parking spaces. With increasing population density this problem can certainly increase unless addressed. Parking lots occupy large areas of scarce land resource therefore it is necessary to identify the driving behaviour in a parking lot to improve it further. This Paper tries study the driving behaviour in the parking lot and for this endeavours it conducted direct observation in three parking lots and used GPS data that was collected prior to this study by the University of Dalarna. To evaluate the driving behaviour in the parking lot direct observation was conducted to obtain overall indices of the parking lot vehicles movement. The parking route taken by the driver was compared with the optimal path to identify the driving behaviour in parking lot in terms of distance. The collected data was evaluated, filtered and analysed to identify the route, the distance and the time the vehicle takes to find a parking space. The outcome of the study shows that driving behaviour in the parking lots varies significantly among the parking user where most of the observed vehicles took unnecessary long time to complete their parking. The study shows that 56% of the 430 observed vehicles demonstrated inefficient driving behaviour as they took long driving path rather the than the optimal path. The study trace this behaviour to two factors, first, the absent of parking guidance in the parking lots and the second is the selectivity of the drivers when choosing the parking space. The study also shows that the ability of GPS data to identify the driving behaviour in the parking lots varies based on the time interval and the type of the device that is being used. The small the time interval the more accurate the GPS data in detecting the driving behaviour in the parking lots.

OPERTI, Felipe Gioachino. Interpolation strategy based on Dynamic Time Warping. 2015. 53 f. Dissertação (Mestrado em Física) - Programa de Pós-Graduação em Física, Departamento de Física, Centro de Ciências, Universidade Federal do Ceará, Fortaleza, 2015. / Submitted by Edvander Pires (edvanderpires@gmail.com) on 2015-04-14T22:11:14Z No. of bitstreams: 1 2015_dis_fgoperti.pdf: 5361657 bytes, checksum: b47dae9c4d72accf5fe2c50b89abaae4 (MD5) / Approved for entry into archive by Edvander Pires(edvanderpires@gmail.com) on 2015-04-16T18:35:49Z (GMT) No. of bitstreams: 1 2015_dis_fgoperti.pdf: 5361657 bytes, checksum: b47dae9c4d72accf5fe2c50b89abaae4 (MD5) / Made available in DSpace on 2015-04-16T18:35:49Z (GMT). No. of bitstreams: 1 2015_dis_fgoperti.pdf: 5361657 bytes, checksum: b47dae9c4d72accf5fe2c50b89abaae4 (MD5) Previous issue date: 2015 / In oil industry, it is essential to have the knowledge of the stratified rocks’ lithology and, as consequence, where are placed the oil and the natural gases reserves, in order to efficiently drill the soil, without a major expense. In this context, the analysis of seismological data is highly relevant for the extraction of such hydrocarbons, producing predictions of profiles through reflection of mechanical waves in the soil. The image of the seismic mapping produced by wave refraction and reflection into the soil can be analysed to find geological formations of interest. In 1978, H. Sakoe et al. defined a model called Dynamic Time Warping (DTW)[23] for the local detection of similarity between two time series. We apply the Dynamic Time Warping Interpolation (DTWI) strategy to interpolate and simulate a seismic landscape formed by 129 depth-dependent sequences of length 201 using different values of known sequences m, where m = 2, 3, 5, 9, 17, 33, 65. For comparison, we done the same operation of interpolation using a Standard Linear Interpolation (SLI). Results show that the DTWI strategy works better than the SLI when m = 3, 5, 9, 17, or rather when distance between the known series has the same order size of the soil layers.

京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第21543号 / 理博第4450号 / 新制||理||1639(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)准教授 福島 竜輝, 教授 熊谷 隆, 教授 牧野 和久 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM

No description available.

Aerobiological sampling using unmanned aerial vehicles (UAVs) is an exciting research field blending various scientific and engineering disciplines. The biological data collected using UAVs helps to better understand the atmospheric transport of microorganisms. Autopilot-equipped UAVs can accurately sample along pre-defined flight plans and precisely regulated altitudes. They can provide even greater utility when they are networked together in coordinated sampling missions: such measurements can yield further information about the aerial transport process. In this work flight vehicle path planning, control and coordination strategies are considered for unmanned autonomous aerial vehicles. A time-optimal path planning algorithm, that is simple enough to be solved in real time, is derived based on geometric concepts. The method yields closed-form solution for an important subset of candidate extremal paths; the rest of the paths are found using a simple numerical root-finding algorithm. A multi-UAV coordination framework is applied to a specific control-volume sampling problem that supports aerobiological data-collection efforts conducted in the lower atmosphere. The work is part of a larger effort that focuses on the validation of atmospheric dispersion models developed to predict the spread of plant diseases in the lower atmosphere. The developed concepts and methods are demonstrated by field experiments focusing on the spread of the plant pathogen <i>Phytophthora infestans</i>. / Ph. D.

[pt] O presente projeto de pesquisa objetiva desenvolver um procedimento para determinação de trajetórias ótimas em pistas de corrida baseado em técnicas de otimização, considerando os limites geométricos da pista e as características dinâmicas do veículo. O veículo será representado por meio de um modelo simplificado de partícula orientada, mas que inclui as capacidades de tração, frenagem e aceleração normal típicas de um veículo terrestre de competição. Primeiramente, é determinada a trajetória de tempo mínimo para uma curva de 90 graus por meio da análise geométrica do problema e em seguida, é obtida a solução analítica geral para aplicação a qualquer ângulo. Em seguida, técnicas de otimização com restrição são empregadas de forma a obter a curva de menor tempo que concatena as trajetórias ótimas individuais de cada curva, previamente determinadas. São estudadas, ainda, as características dinâmicas de algumas curvas polinomiais para inferir aquela que melhor pode ser aplicada no processo de concatenação. A trajetória de menor tempo da pista de corrida obtida pelo procedimento de concatenação é apresentada e é feita uma análise das vantagens e desvantagens do método proposto. Como alternativa, é apresentada uma visão geral do problema de controle ótimo e é formulada a modelagem completa do problema de trajetória de mínimo tempo utilizando esta abordagem, incluindo as restrições dinâmicas do veículo e as restrições geométricas da pista. Algumas técnicas possíveis para solução do problema de controle ótimo são sugeridas. / [en] This work proposes a new procedure to determine the optimal trajectory on race tracks based on constrained optimization techniques, where the constraints are defined by means of the dynamic characteristics of the vehicle and the geometrical limits of the track. The vehicle is represented by an oriented particle with the capabilities of traction, braking and normal acceleration, which are typical in a competition vehicle. First, the minimum-time trajectory for a 90-degree curve is obtained through a geometrical analysis of the problem. The solution is then expanded to be applied to all angles. Starting from the individual minimum-time trajectory for each curve of the track, constrained optimization techniques are employed in order to obtain the shorter curve that concatenates these individual optimal trajectories. The dynamic characteristics of some polynomial curves are analyzed to infer the one that can best be applied in the concatenation process. The minimum-time trajectory for the race track obtained by the concatenation procedure is presented and the advantages and disadvantages of the proposed method are discussed. Alternatively, an overview of the optimal control problem is presented and a complete model of the minimum-time trajectory problem is developed using this approach, including the dynamic constraints of the vehicle and the geometric constraints of the track. Some possible methods for the solution of the optimal control problem are suggested.