Asset Details
Do you wish to reserve the book?
MAPS\\(^2\\): Multi-Robot Autonomous Motion Planning under Signal Temporal Logic Specifications
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
MAPS\\(^2\\): Multi-Robot Autonomous Motion Planning under Signal Temporal Logic Specifications
Do you wish to request the book?
MAPS\\(^2\\): Multi-Robot Autonomous Motion Planning under Signal Temporal Logic Specifications
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
MAPS\\(^2\\): Multi-Robot Autonomous Motion Planning under Signal Temporal Logic Specifications
2025
Overview
This article presents MAPS\\(^2\\) : a distributed algorithm that allows multi-robot systems to deliver coupled tasks expressed as Signal Temporal Logic (STL) constraints. Classical control theoretical tools addressing STL constraints either adopt a limited fragment of the STL formula or require approximations of min/max operators, whereas works maximising robustness through optimisation-based methods often suffer from local minima, relaxing any completeness arguments due to the NP-hard nature of the problem. Endowed with probabilistic guarantees, MAPS\\(^2\\) provides an anytime algorithm that iteratively improves the robots' trajectories. The algorithm selectively imposes spatial constraints by taking advantage of the temporal properties of the STL. The algorithm is distributed, in the sense that each robot calculates its trajectory by communicating only with its immediate neighbours as defined via a communication graph. We illustrate the efficiency of MAPS\\(^2\\) by conducting extensive simulation and experimental studies, verifying the generation of STL satisfying trajectories.
Publisher
Cornell University Library, arXiv.org
Subject
