To Örebro University

oru.seÖrebro University Publications
1112131415161714 of 89
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Orchestrating Robot Fleet Trajectories: Bridging discrete planning and continuous control for non-holonomic fleets
Örebro University, School of Science and Technology.ORCID iD: 0000-0001-7289-8292
2026 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

This manuscript addresses the problem of planning collision-free motions for a multi-robot system with non-holonomic dynamics, in environments with static obstacles, while minimizing a user-defined c ost f unction. The dynamics are a non-convex set of ODEs with no closed-form solution, and enforcing collision-avoidance introduces inter-dependencies between robots’ configuration spaces, leading to exponential growth of the search space. These properties make the multi-robot planning problem particularly challenging and worth solving. We situate our work within tightly-coupled planning approaches, contrasting trajectory optimization and graph-search methods, which offer complementary relaxations of the problem.

We show that the interplay between discrete and continuous spaces is a defining characteristic of multi-robot planning. To address it, we propose a framework that sequences a graph-based multi-robot planning method with a distributed consensus optimization approach. A discrete graph abstracts the problem into transitions on a robot-polygon occupancy graph, capturing environment connectivity, polygonal capacities, and penalties for shared regions. We demonstrate a polynomial reduction of this graph to a dynamic network that enables efficient computation of discrete trajectories minimizing polygonal transitions, path length, or makespan.

The discrete plan partitions the problem into subsets of non-overlapping robots and polygons, this parameterizes simpler optimization instances to be solved concurrently with a distributed optimization consensus method. We integrate a single-robot sequential programming method to handle dynamics nonconvexities with a proximal consensus scheme coordinating inter-robot collision constraints. This hybrid framework bridges graph-based and optimization-based methods in a non-committal manner, allowing decisions to be deferred to later phases. The proposed methodologies, individually and within the framework, are experimentally validated and shown to scale to tens of non-holonomic robots navigating environments with hundreds of polygons while finding locally optimal trajectories.

Place, publisher, year, edition, pages
Örebro: Örebro University , 2026. , p. 151
Series
Örebro Studies in Technology, ISSN 1650-8580 ; 120
Keywords [en]
trajectory optimization, multi-robot path planning, time-expanded networks, convex-programming, proximal methods, graph-based methods and decomposition
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-131754ISBN: 9789175298245 (print)OAI: oai:DiVA.org:oru-131754DiVA, id: diva2:2108256
Public defence
2026-11-13, Örebro universitet, Forumhuset, Hörsal F, Fakultetsgatan 1, Örebro, 13:30 (English)
Opponent
Supervisors
Available from: 2026-10-06 Created: 2026-10-06 Last updated: 2026-10-28Bibliographically approved

Open Access in DiVA

Cover(170 kB)21 downloads
File information
File name COVER01.pdfFile size 170 kBChecksum SHA-512
426bbf9f5e8486c6519eb816c3cdad7e74b5369ca5986dd8dc5954b34eb82c1ad618fd593d3db3cafaa53ae5cec5ee38691130ff9b158b82f0dd236e286bf7ca
Type coverMimetype application/pdf
Orchestrating Robot Fleet Trajectories: Bridging discrete planning and continuous control for non-holonomic fleets(10464 kB)59 downloads
File information
File name FULLTEXT01.pdfFile size 10464 kBChecksum SHA-512
a64885682b4746abb58a7c869bd12e403aa9d4bcd0ce9a3ee019fd758f09ec97db48738553f4c5005dcccf8b544a7c1e7e9ebf36333bd05c31169fac79968f8e
Type fulltextMimetype application/pdf
Spikblad(251 kB)20 downloads
File information
File name SPIKBLAD01.pdfFile size 251 kBChecksum SHA-512
b9cd9eec42f6f418bb5664926751d5c09843240cb7afd182c4b8aac706d3b969d41d0a7851ff8044ac80b855d89c710d1eb6e0d9d834be6a88b1700275b00a41
Type spikbladMimetype application/pdf

Authority records

Salvado, João

Search in DiVA

By author/editor
Salvado, João
By organisation
School of Science and Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 59 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 16776 hits
1112131415161714 of 89
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf