Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Multi-agent motion planning"”.
-
Coordinated Multi-Agent Motion Planning Under Realistic Constraints
… characterization. Included in this class of multi-agent problems are the so called radar deception problem, formation keeping and formation reconfiguration. An intrinsic geometric formulation of the associated constraints unifies this class of problems and it is the first time such a …
-
Stigmergy-Based Multi-Agent Motion Planning Using QR Codes
… a stigmergy-inspired approach to asynchronous multi-agent motion planning in communication-restricted environments. Building on sampling-based motion planning, it introduces a framework for encoding paths within QR codes that are physically placed in the environment. Feasible paths generated by …
-
Model-free Multi-Agent Motion Planning with Non-Uniform Sensors
… of a particular task. This thesis focuses on planning a viable path for multiple robots through a shared, unknown environment and the coordinated execution of that plan as the environment changes. Furthermore, we restrict the problem such that not all robots have the ability to sense their …
-
A Safe and Robust Multi-Agent Motion Planning Framework for Urban Air Mobility
… challenge for these drones in recent years. Agents must be capable of real-time dynamic obstacle avoidance, planning motion in accordance with their own constraints, and detecting system failures or potential adversarial attacks. They must also be prepared to react to the behavior of other …
-
Perception and Planning of Connected and Automated Vehicles
… addresses the design problems of perception and planning in CAVs. A decentralized sensor fusion system is designed using Multi-target tracking to identify targets within a vehicle's field of view, enumerate each target with the lane it occupies, and highlight the most important object (MIO) for …
-
Generalized Sampling-Based Feedback Motion Planners
The motion planning problem can be formulated as a Markov decision process (MDP), if the uncertainties in the robot motion and environments can be modeled probabilistically. The complexity of solving these MDPs grow exponentially as the dimension of the problem increases and hence, it is nearly …