Safe Multi-Agent Planning Under Time-Window Temporal Logic Specifications

Thumbnail Image

Persistent link to this item

View Statistics

Journal Title

Journal ISSN

Volume Title


Safe Multi-Agent Planning Under Time-Window Temporal Logic Specifications

Published Date




Thesis or Dissertation


This thesis addresses a multi-agent planning problem, where each agent aims to achieve an individual task while avoiding collisions with other agents in the environment. It is assumed that each agent's task is expressed as a Time-Window Temporal Logic (TWTL) specification defined over a 3D environment. A distributed receding horizon algorithm is introduced for online planning of trajectories. Under mild assumptions on the environment topology, the resulting agent trajectories are always safe (collision-free) and lead to the satisfaction of the TWTL specifications or their finite temporal relaxations. Accordingly, each agent is guaranteed to safely achieve its task while avoiding deadlocks. Performance of the proposed algorithm is demonstrated via numerical simulations and through experiments with quadrotors.


University of Minnesota M.S. thesis. May 2020. Major: Aerospace Engineering and Mechanics. Advisor: Derya Aksaray. 1 computer file (PDF); vii, 77 pages.

Related to



Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Peterson, Ryan. (2020). Safe Multi-Agent Planning Under Time-Window Temporal Logic Specifications. Retrieved from the University Digital Conservancy,

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.