IDEAS home Printed from https://ideas.repec.org/a/taf/tcybxx/v9y2023i3p273-312.html
   My bibliography  Save this article

LTL cross entropy optimisation for quadcopter task orchestration

Author

Listed:
  • Christopher Banks
  • Samuel Coogan
  • Magnus Egerstedt

Abstract

This paper presents a task orchestration framework for multi-agent systems utilising linear temporal logic (LTL) and cross entropy optimisation, a stochastic optimisation technique used for rare-event sampling. We define task orchestration as a combination of task decomposition, allocation and planning for a quadcopter or team of quadcopters given a high-level specification. Specifically, we consider tasks that are complex and consist of environment constraints, system constraints, or both, that must be satisfied. We first approach motion planning for the single agent case where transition systems for the environment allow tasks to be developed as linear temporal logic (LTL) specifications. Trajectories are then generated via motion primitives for a single quadcopter and optimised via cross entropy to ensure optimal satisfaction of a cost function. We extend this work to the multi-agent case where a team of homogeneous quadcopters are considered to satisfy an LTL specification. In order to provide faster computations and initial cost-agnostic sampling, we formulate the online version of multi-agent task allocation via cross entropy for tasks specified in LTL specifications. The results of this framework are verified in simulation and experimentally with a team of quadcopters.

Suggested Citation

  • Christopher Banks & Samuel Coogan & Magnus Egerstedt, 2023. "LTL cross entropy optimisation for quadcopter task orchestration," Cyber-Physical Systems, Taylor & Francis Journals, vol. 9(3), pages 273-312, July.
    • Handle: RePEc:taf:tcybxx:v:9:y:2023:i:3:p:273-312
    DOI: 10.1080/23335777.2022.2083689
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/23335777.2022.2083689
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/23335777.2022.2083689?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tcybxx:v:9:y:2023:i:3:p:273-312. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tcyb .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.