CEAI_LOGO

LTL Task Decomposition for 3D High-Level Path Planning

Authors

  • Sofia Hustiu

    1) Dept. of Automatic Control and Applied Informatics, Faculty of Automatic Control and Computer Engineering, “Gheorghe Asachi” Technical University of Iasi, Romania 2) Engineering Research Institute of Aragon (I3A), University of Zaragoza, Spain

  • Ioana Hustiu

    Dept. of Automatic Control and Applied Informatics, Faculty of Automatic Control and Computer Engineering, “Gheorghe Asachi” Technical University of Iasi

  • Marius Kloetzer

    Dept. of Automatic Control and Applied Informatics, Faculty of Automatic Control and Computer Engineering, “Gheorghe Asachi” Technical University of Iasi

  • Cristian Mahulea

    Engineering Research Institute of Aragon (I3A), University of Zaragoza

DOI:
https://doi.org/10.61416/ceai.v23i3.7355
Abstract
The paper addresses the problem of planning the motion of a team of drones such that a co-safe Linear Temporal Logic (LTL) formula is accomplished. The high-level formula can include visits or avoidance of some known regions of interest from the 3D environment. The team mission is decomposed into independent tasks that can be accomplished by each drone, while the workspace is abstracted by a cell decomposition algorithm based on rectangular cuboid partitions. An optimization problem for the task assignment yields the tasks to be fulfilled by each drone, and independent trajectories are automatically obtained. The contributions include an algorithm for decomposing the co-safe LTL specification into independent tasks, a recursive cell decomposition method for 3D environments with regions of interest rather than obstacles, and an overall planning procedure that returns a trajectory for each drone. The independent tasks imply that the drones fulfilling them do not need to constantly communicate, the flight of each agent relying on positioning sensors for following the predefined path. Simulations and comparative studies based on different partitions and scenarios are included.
References
Downloads
Published
2021-09-27
Issue
Vol. 23 No. 3 (2021)
Section
Articles