IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4419-5689-7_16.html
   My bibliography  Save this book chapter

Minimal Switching Time of Agent Formations with Collision Avoidance

In: Dynamics of Information Systems

Author

Listed:
  • Dalila B. M. M. Fontes

    (Universidade do Porto)

  • Fernando A. C. C. Fontes

    (Universidade do Porto)

Abstract

Summary We address the problem of dynamically switching the topology of a formation of a number of undistinguishable agents. Given the current and the final topologies, each with n agents, there are n! possible allocations between the initial and final positions of the agents. Given the agents maximum velocities, there is still a degree of freedom in the trajectories that might be used in order to avoid collisions. We seek an allocation and corresponding agent trajectories minimizing the maximum time required by all agents to reach the final topology, avoiding collisions. Collision avoidance is guaranteed through an appropriate choice of trajectories, which might have consequences in the choice of an optimal permutation. We propose here a dynamic programming approach to optimally solve problems of small dimension. We report computational results for problems involving formations with up to 12 agents.

Suggested Citation

  • Dalila B. M. M. Fontes & Fernando A. C. C. Fontes, 2010. "Minimal Switching Time of Agent Formations with Collision Avoidance," Springer Optimization and Its Applications, in: Michael J. Hirsch & Panos M. Pardalos & Robert Murphey (ed.), Dynamics of Information Systems, chapter 0, pages 305-321, Springer.
    • Handle: RePEc:spr:spochp:978-1-4419-5689-7_16
    DOI: 10.1007/978-1-4419-5689-7_16
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-1-4419-5689-7_16. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.