• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 91
  • 12
  • 9
  • 5
  • 3
  • 3
  • 1
  • Tagged with
  • 149
  • 149
  • 50
  • 41
  • 41
  • 40
  • 36
  • 32
  • 30
  • 25
  • 23
  • 22
  • 22
  • 21
  • 21
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

Flocking for Multi-Agent Dynamical Systems

Wan, Zhaoxin January 2012 (has links)
In this thesis, we discuss models for multi-agent dynamical systems. We study the tracking/migration problem for flocks and a theoretical framework for design and analysis of flocking algorithm is presented. The interactions between agents in the systems are denoted by potential functions that act as distance functions, hence, the design of proper potential functions are crucial in modelling and analyzing the flocking problem for multi-agent dynamical systems. Constructions for both non-smooth potential functions and smooth potential functions with finite cut-off are investigated in detail. The main contributions of this thesis are to extend the literature of continuous flocking models with impulsive control and delay. Lyapunov function techniques and techniques for stability of continuous and impulsive switching system are used, we study the asymptotic stability of the equilibrium of our models with impulsive control and discovery that by applying impulsive control to Olfati-Saber's continuous model, we can remove the damping term and improve the performance by avoiding the deficiency caused by time delay in velocity sensing. Additionally, we discuss both free-flocking and constrained-flocking algorithm for multi-agent dynamical system, we extend literature results by applying velocity feedbacks which are given by the dynamical obstacles in the environment to our impulsive control and successfully lead to flocking with obstacle avoidance capability in a more energy-efficient way. Simulations are given to support our results, some conclusions are made and future directions are given.
52

Application of Genetic Algorithm to a Forced Landing Manoeuvre on Transfer of Training Analysis

Tong, Peter, mail@petertong.com January 2007 (has links)
This study raises some issues for training pilots to fly forced landings and examines the impact that these issues may have on the design of simulators for such training. It focuses on flight trajectories that a pilot of a single-engine general aviation aircraft should fly after engine failure and how pilots can be better simulator trained for this forced landing manoeuvre. A sensitivity study on the effects of errors and an investigation on the effect of tolerances in the aerodynamic parameters as prescribed in the Manual of Criteria for the Qualification of Flight Simulators have on the performance of flight simulators used for pilot training was carried out. It uses a simplified analytical model for the Beech Bonanza model E33A aircraft and a vertical atmospheric turbulence based on the MIL-F-8785C specifications. It was found that the effect of the tolerances is highly sensitive on the nature of the manoeuvre flown and that in some cases, negative transfe r of training may be induced by the tolerances. A forced landing trajectory optimisation was carried out using Genetic Algorithm. The forced landing manoeuvre analyses with pre-selected touchdown locations and pre-selected final headings were carried out for an engine failure at 650 ft AGL for bank angles varying from banking left at 45° to banking right at 45°, and with an aircraft's speed varying from 75.6 mph to 208 mph, corresponding to 5% above airplane's stall speed and airplane's maximum speed respectively. The results show that certain pre-selected touchdown locations are more susceptible to horizontal wind. The results for the forced landing manoeuvre with a pre-selected location show minimal distance error while the quality of the results for the forced landing manoeuvre with a pre-selected location and a final heading show that the results depend on the end constraints. For certain pre-selected touchdown locations and final headings, the airplane may either touchdown very close to the pre-selected touchdown location but with greater final h eading error from the pre-selected final heading or touchdown with minimal final heading error from the pre-selected final heading but further away from the pre-selected touchdown location. Analyses for an obstacle avoidance forced landing manoeuvre were also carried out where an obstacle was intentionally placed in the flight path as found by the GA program developed for without obstacle. The methodology developed successfully found flight paths that will avoid the obstacle and touchdown near the pre-selected location. In some cases, there exist more than one ensemble grouping of flight paths. The distance error depends on both the pre-selected touchdown location and where the obstacle was placed. The distance error tends to increase with the addition of a specific final heading requirement for an obstacle avoidance forced landing manoeuvre. As with the case without specific final heading requirement, there is a trade off between touching down nearer to the pre-selected location and touching down with a smaller final heading error.
53

The Doghouse Plot: History, Construction Techniques, and Application

January 2017 (has links)
abstract: The Doghouse Plot visually represents an aircraft’s performance during combined turn-climb maneuvers. The Doghouse Plot completely describes the turn-climb capability of an aircraft; a single plot demonstrates the relationship between climb performance, turn rate, turn radius, stall margin, and bank angle. Using NASA legacy codes, Empirical Drag Estimation Technique (EDET) and Numerical Propulsion System Simulation (NPSS), it is possible to reverse engineer sufficient basis data for commercial and military aircraft to construct Doghouse Plots. Engineers and operators can then use these to assess their aircraft’s full performance envelope. The insight gained from these plots can broaden the understanding of an aircraft’s performance and, in turn, broaden the operational scope of some aircraft that would otherwise be limited by the simplifications found in their Airplane Flight Manuals (AFM). More importantly, these plots can build on the current standards of obstacle avoidance and expose risks in operation. / Dissertation/Thesis / Masters Thesis Aerospace Engineering 2017
54

Locomoção visualmente guiada na transposição de obstáculos: efeitos de amostras visuais estáticas e dinâmica

Menuchi, Marcos Rodrigo Trindade Pinheiro [UNESP] 28 June 2005 (has links) (PDF)
Made available in DSpace on 2014-06-11T19:22:52Z (GMT). No. of bitstreams: 0 Previous issue date: 2005-06-28Bitstream added on 2014-06-13T19:08:25Z : No. of bitstreams: 1 menuchi_mrtp_me_rcla.pdf: 321486 bytes, checksum: eb28a1ece2b065e6d1f1861d4c4f8762 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Durante a locomoção, ocorre um padrão de movimento visual referido como um campo de fluxo óptico. Para explorar como os ajustamentos locomotores são influenciados por este padrão, um paradigma experimental foi desenvolvido para anular o fluxo óptico durante a locomoção e ultrapassagem de obstáculo. O objetivo deste estudo foi investigar a contribuição de amostragens visuais estáticas e dinâmica na locomoção e ultrapassagem de obstáculos de diferentes alturas. Dez indivíduos (23,4 l 1,28 anos de idade, de ambos os gêneros) foram convidados a andar sobre uma passarela e ultrapassar um de dois obstáculos personalizados (obstáculo alto = altura do joelho e obstáculo baixo = altura do tornozelo) posicionado a 5m do ponto de partida. Diodos emissores de luz foram afixados no 5º metatarso e face lateral do calcâneo em ambos os pés e suas trajetórias foram filmados por quatro filmadoras digitais posicionadas bilateralmente à passarela. Dois blocos de tentativas foram apresentados em função das condições de amostragens visuais. No primeiro bloco, 10 tentativas com amostragem visual dinâmica (iluminação normal) foram apresentadas. No segundo bloco de tentativas, duas condições de amostragens visuais estáticas foram apresentadas de forma aleatória por meio de uma luz estroboscópica (2 flashes/segundo e 4 flashes/segundo). A duração de cada flash não ultrapassou 16ms e forneceu apenas imagens estáticas do ambiente. A altura do obstáculo foi randomizada em cada bloco de tentativas. Cinco tentativas para cada condição foram coletadas, totalizando 30 tentativas por participante. Todas as imagens foram digitalizadas e reconstruídas no plano tri-dimensional. As variáveis dependentes na fase de aproximação (comprimentos dos dois passos anteriores à ultrapassagem) e na fase de ultrapassagem... / During locomotion, a pattern of visual motion referred as an optic flow field occurs. In order to explore how the locomotor adjustments are influenced by this pattern, an experimental paradigm was developed to remove the optic flow during locomotion and obstacle avoidance. The aim of this study was to investigate the contribution of the static and dynamic visual sampling on the locomotion and obstacle avoidance of different heights. Ten individuals (23.4 l 1.28 years of age, both genders) were invited to walk on a pathway and to avoid one out of two personalized obstacles (high obstacle = knee height and low obstacle = ankle height) positioned 5m from the starting position. Light emitting diodes were fixed on the fifth metatarsal and calcaneus lateral face in both feet and their trajectories were recorded by four digital cameras bilaterally positioned related to the pathway. Two trial blocks were presented depending of the visual sampling conditions. In the first block, 10 trials with visual dynamic sampling (normal light) were presented. In the second trial block, two conditions of the static visual sampling frequencies were presented in an randomized way by means of the stroboscopic light (2 flashes/second or 4 flashes/second). Each flash duration was about 16ms and provided only environmental static images. Obstacle height was randomized for each trial block. Five trials for each experimental condition were collected totalizing 30 trials for each participant. All images were digitalized and reconstructed in the 3D plane. Dependent variables in the approach phase (last two step lengths before crossing) and in the crossing phase (horizontal toe distance to the obstacle prior crossing, obstacle toe clearance and mean horizontal velocity for each foot) were selected. The results revealed differences... (Complete abstract, access undermentioned electronic address)
55

Roteamento automático de empilhadeiras robóticas em armazém inteligente / Automatic routing of robotic forklifts in intelligent warehouse

Kelen Cristiane Teixeira Vivaldini 14 May 2010 (has links)
Cada vez mais empilhadeiras robóticas são utilizadas para a tarefa de transporte em indústrias e armazéns. O gerenciamento dessas empilhadeiras é a chave para um sistema de transporte eficiente visando maximizar sua taxa de transferência. Um dos principais problemas na operação desses sistemas é a decisão de roteamento das empilhadeiras dentro dos depósitos. Este trabalho propõe um algoritmo de roteamento com a capacidade de realizar a otimização das rotas em tempo-real. Na computação da rota são considerados o desvio de obstáculos, as dimensões e as propriedades físicas das empilhadeiras, pois uma trajetória calculada deste ponto de referência está livre de colisões durante a execução do roteamento. Para realizar os testes foram utilizados os softwares Player/Stage, os quais permitem que simulações do funcionamento do sistema de roteamento sejam realizadas antes que os algoritmos sejam testados em robôs reais. Através dos testes simulados, analisou-se a capacidade de locomoção das empilhadeiras referente ao calculo da melhor rota no ambiente proposto, com o intuito de melhorar o ganho de performance no planejamento de trajetória. / Forklift robots have been increasingly used in transport tasks in industries and warehouses. The key to an efficient transport system is held by a sound management of these forklifts that aim to maximize the transference rate. One of the main problems faced by the transportation systems is routing decision for forklifts within warehouse. The present paper proposes a routing algorithm to calculate optimal routes in real time. Therefore, its computation takes into account obstacle avoidance, the dimension and physical properties of the forklifts, since the calculated path regarding the routing is conflict-free. Simulations were carried out using the software Player/Stage before the algorithms were tested in a real robot. Simulated tests were analyzed in order to observe the locomotion ability of forklifts regarding calculation of the best route in the environment proposed to improve the trajectory planning performance will be assessed.
56

Obstacle Detection for Indoor Navigation of Mobile Robots

Islam Rasel, Rashedul 14 August 2017 (has links) (PDF)
Obstacle detection is one of the major focus area on image processing. For mobile robots, obstacle detection and collision avoidance is a notorious problem and is still a part of the modern research. There are already a lot of research have been done so far for obstacle detection and collision avoidance. This thesis evaluates the existing various well-known methods and sensors for collision free navigation of the mobile robot. For moving obstacle detection purpose the frame difference approach is adopted. Robotino® is used as the mobile robot platform and additionally Microsoft Kinect is used as 3D sensor. For getting information from the environment about obstacle, the 9-built-in distance sensor of Robotino® and 3D depth image data from the Kinect is used. The combination is done to get the maximum advantages for obstacles information. The detection of moving object in front of the sensor is a major interest of this work.
57

Robot Navigation Using Velocity Potential Fields and Particle Filters for Obstacle Avoidance

Bai, Jin January 2015 (has links)
In this thesis, robot navigation using the Particle Filter based FastSLAM approach for obstacle avoidance derived from a modified Velocity Potential Field method was investigated. A switching controller was developed to deal with robot’s efficient turning direction when close to obstacles. The determination of the efficient turning direction is based on the local map robot derived from its on board local sensing. The estimation of local map and robot path was implemented using the FastSLAM approach. A particle filter was utilized to obtain estimated robot path and obstacles (local map). When robot sensed only obstacles, the estimated robot positions was regarding to obstacles based the measurement of the distance between the robot and obstacles. When the robot detected the goal, estimation of robot path will switch to estimation with regard to the goal in order to obtain better estimated robot positions. Both simulation and experimental results illustrated that estimation with regard to the goal performs better than estimation regarding only to obstacles, because when robot travelled close to the goal, the residual error between estimated robot path and the ideal robot path becomes monotonously decreasing. When robot reached the goal, the estimated robot position and the ideal robot position converge. We investigated our proposed approach in two typical robot navigation scenarios. Simulations were accomplished using MATLAB, and experiments were conducted with the help of both MATLAB and LabVIEW. In simulations and experiments, the robot successfully chose efficiently turning direction to avoid obstacles and finally reached the goal.
58

Le mouvement segmentaire au service du déplacement dans la marche : analyse couplée des deux niveaux / Walking movement and trajectory : a combined analysis of the two levels

Marin, Antoine 15 December 2014 (has links)
La marche est un mécanisme complexe impliquant l’élaboration de trajectoires dans des milieux divers et variés et la réalisation des mouvements segmentaires qui permettent de les parcourir. Elle est alors dépendante de l’environnement, des obstacles et autres individus qui le peuplent mais également des capacités physiques du corps humain. De part cette complexité, l’étude de la marche est généralement compartimentée en deux niveaux : la génération de trajectoires locomotrices d’une part et les mouvements des membres d’autre part. Ce travail vise à proposer un processus complet d’analyse de la marche, en s’intéressant au lien unissant les trajectoires locomotrices aux mouvements segmentaires. Dans un premier temps nous nous intéressons à la génération de trajectoires. Plus particulièrement, nous nous focalisons sur une situation de croisement entre deux piétons et sur les stratégies mises en place pour éviter la collision. Puis, nous portons notre attention sur la manière dont les endroits de pose de pieds sont influencés par la trajectoire. Cette analyse nous conduit à proposer un modèle de génération d’empreintes de pas. Enfin, nous nous intéressons à la générations des trajectoires articulaires menant au mouvement de marche. Par l’utilisation de la méthode de linéarisation locale nous proposons une nouvelle méthodologie pour la simulation de la marche à partir d’une entrée unique : la prochaine empreinte pas / Walking is a complex mecanism involving trajectories generation in various environments and motion generation in order to follow the path. Then, it is dependent on environment, obstacles and peoples moving around but also on body capabilities. This complexity lead scientits to split walking analysis in two levels : trajectory generation in one hand, and motion generation in the othe hand. This work aim to provide a global walking analysis processus by linking trajectorires and motion generation. First, we explore walking trajectories throw a particular situation : pedestrians crossing. Here we take interest in trajectories and speed adaptations. Then, we sink for the link between trajectory and heelstrike. It lead us to develop a model for heelstrike generation based on trajectory. Finally, we take interest in walking motion simulation. By the use of local linearization, we provide a new methodology for joints joints angles generation
59

Decentralized Control of Collective Transport by Multi-Robot Systems with Minimal Information

January 2020 (has links)
abstract: One potential application of multi-robot systems is collective transport, a task in which multiple mobile robots collaboratively transport a payload that is too large or heavy to be carried by a single robot. Numerous control schemes have been proposed for collective transport in environments where robots can localize themselves (e.g., using GPS) and communicate with one another, have information about the payload's geometric and dynamical properties, and follow predefined robot and/or payload trajectories. However, these approaches cannot be applied in uncertain environments where robots do not have reliable communication and GPS and lack information about the payload. These conditions characterize a variety of applications, including construction, mining, assembly in space and underwater, search-and-rescue, and disaster response. Toward this end, this thesis presents decentralized control strategies for collective transport by robots that regulate their actions using only their local sensor measurements and minimal prior information. These strategies can be implemented on robots that have limited or absent localization capabilities, do not explicitly exchange information, and are not assigned predefined trajectories. The controllers are developed for collective transport over planar surfaces, but can be extended to three-dimensional environments. This thesis addresses the above problem for two control objectives. First, decentralized controllers are proposed for velocity control of collective transport, in which the robots must transport a payload at a constant velocity through an unbounded domain that may contain strictly convex obstacles. The robots are provided only with the target transport velocity, and they do not have global localization or prior information about any obstacles in the environment. Second, decentralized controllers are proposed for position control of collective transport, in which the robots must transport a payload to a target position through a bounded or unbounded domain that may contain convex obstacles. The robots are subject to the same constraints as in the velocity control scenario, except that they are assumed to have global localization. Theoretical guarantees for successful execution of the task are derived using techniques from nonlinear control theory, and it is shown through simulations and physical robot experiments that the transport objectives are achieved with the proposed controllers. / Dissertation/Thesis / Doctoral Dissertation Mechanical Engineering 2020
60

A Generic Framework for Robot Motion Planning and Control

Behere, Sagar January 2010 (has links)
This thesis deals with the general problem of robot motion planning and control. It proposes the hypothesis that it should bepossible to create a generic software framework capable of dealing with all robot motion planning and control problems, independent of the robot being used, the task being solved, the workspace obstacles or the algorithms employed. The thesis work then consisted of identifying the requirements and creating a design and implementation of such a framework. This report motivates and documents the entire process. The framework developed was tested on two different robot arms under varying conditions. The testing method and results are also presented.The thesis concludes that the proposed hypothesis is indeed valid.

Page generated in 0.0637 seconds