2026-09-19T02:25:47Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1474462023-01-20T03:57:15Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

How, Jonathan P. Tordesillas Torres, Jesus Massachusetts Institute of Technology. Department of Aeronautics and Astronautics 2023-01-19T19:50:58Z 2023-01-19T19:50:58Z 2022-09 2022-09-21T13:15:07.655Z https://hdl.handle.net/1721.1/147446 https://orcid.org/0000-0001-6848-4070 While efficient and fast trajectory planners in static worlds have been extensively proposed for UAVs (Unmanned Aerial Vehicles), a 3D real-time planner for environments with static obstacles, dynamic obstacles, and other planning agents still remains an open problem. The dynamic nature of these environments demands high replanning rates, making this problem especially hard on computationally limited platforms. Existing state-of-the-art planners reduce the computational complexity at the expense of more conservative results by relying on three main simplifications or assumptions: First, the collision avoidance constraints are imposed using the Bernstein and B-Spline polynomial bases, which do not tightly enclose a given interval of a polynomial trajectory. Second, multiagent planners usually make centralized and/or synchronized computation assumptions, which lead to poor scalability with the number of agents or can degrade the overall performance. Finally, position and yaw are decoupled when optimizing perception-aware trajectories, which produces highly conservative results. This thesis addresses the aforementioned limitations with the following contributions: First, it presents the MINVO basis, a polynomial basis that generates the simplex with minimum volume enclosing a polynomial curve, therefore reducing the conservativeness in the obstacle avoidance constraints. Leveraging the MINVO basis, this thesis then proposes a tractable way to avoid dynamic obstacles by imposing linear separability constraints between the polyhedral enclosures of the intervals of the trajectories. This is then extended to multiagent scenarios, and a decentralized and asynchronous obstacle avoidance algorithm among many replanning agents is presented. Real-time perception-aware planning is achieved by implicitly imposing the underactuated dynamics of the UAV through the Hopf fibration while jointly optimizing the full pose. Finally, a reduction of two orders of magnitude in the computation time is obtained by learning a policy that imitates the optimization-based planner. These proposed contributions are extensively evaluated in simulation, showing up to 32 agents planning in real time, and in real-world experiments, showcasing flights up to 5.8 m/s in unknown dynamic environments with only onboard computation. Ph.D. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ Trajectory Planning for Flights in Multiagent and Dynamic Environments Thesis application/pdf Doctoral Doctor of Philosophy Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="208185d0-fa94-45d8-89be-34a1d8aa4e7a"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>Trajectory Planning for Flights in Multiagent and Dynamic Environments</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2022-09</PublicationDate> <Authors> <Author> <DisplayName>Tordesillas Torres, Jesus</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>While efficient and fast trajectory planners in static worlds have been extensively proposed for UAVs (Unmanned Aerial Vehicles), a 3D real-time planner for environments with static obstacles, dynamic obstacles, and other planning agents still remains an open problem. The dynamic nature of these environments demands high replanning rates, making this problem especially hard on computationally limited platforms. Existing state-of-the-art planners reduce the computational complexity at the expense of more conservative results by relying on three main simplifications or assumptions: First, the collision avoidance constraints are imposed using the Bernstein and B-Spline polynomial bases, which do not tightly enclose a given interval of a polynomial trajectory. Second, multiagent planners usually make centralized and/or synchronized computation assumptions, which lead to poor scalability with the number of agents or can degrade the overall performance. Finally, position and yaw are decoupled when optimizing perception-aware trajectories, which produces highly conservative results. This thesis addresses the aforementioned limitations with the following contributions: First, it presents the MINVO basis, a polynomial basis that generates the simplex with minimum volume enclosing a polynomial curve, therefore reducing the conservativeness in the obstacle avoidance constraints. Leveraging the MINVO basis, this thesis then proposes a tractable way to avoid dynamic obstacles by imposing linear separability constraints between the polyhedral enclosures of the intervals of the trajectories. This is then extended to multiagent scenarios, and a decentralized and asynchronous obstacle avoidance algorithm among many replanning agents is presented. Real-time perception-aware planning is achieved by implicitly imposing the underactuated dynamics of the UAV through the Hopf fibration while jointly optimizing the full pose. Finally, a reduction of two orders of magnitude in the computation time is obtained by learning a policy that imitates the optimization-based planner. These proposed contributions are extensively evaluated in simulation, showing up to 32 agents planning in real time, and in real-world experiments, showcasing flights up to 5.8 m/s in unknown dynamic environments with only onboard computation.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>