Robotic Path Planning Algorithms Open access

Multi-Robot Path Planning with Time Windows and Boolean Specifications

Siyu LIU, Syrine Bouazza, Zhou He, Dimitri Lefebvre

Research Square | Nov 16, 2026

Abstract

Abstract

Path planning for multi-robot systems under complex task-logical specifications and strict temporal constraints poses significant combinatorial challenges. Existing approaches often handle logical and temporal requirements separately, limiting their scalability and practical applicability. To overcome this limitation, we propose a unified planning framework that seamlessly integrates Boolean specifications with time-window constraints. The problem is first formalized as a Mixed-Integer Linear Programming model that captures logical dependencies and timing requirements, including a collision avoidance module. To improve scalability for large-scale instances, we develop a Beam Search-based heuristic algorithm tailored for handling time windows. A similarity-based filtering mechanism is further incorporated to promote solution diversity and mitigate premature convergence. Experimental results demonstrate that the proposed approach achieves a desirable trade-off between computational efficiency and solution quality, offering a robust and scalable solution for multi-robot path planning under complex temporal-logical specifications.

Direct answer

What can I do from this paper page?

Use this page to scan "Multi-Robot Path Planning with Time Windows and Boolean Specifications" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Robotic Path Planning Algorithms research, save the paper, or map adjacent work.

Authors

Researchers on this paper

Siyu LIU

first | Université Le Havre Normandie

Syrine Bouazza

middle | Université Le Havre Normandie | ORCID 0000-0001-5040-3690

Zhou He

middle | Shaanxi University of Science and Technology | ORCID 0000-0003-2486-1246

Dimitri Lefebvre

last | Université Le Havre Normandie | ORCID 0000-0001-7060-756X

Research areas

Follow related topics

Citation

BibTeX

@article{LIU2026Multi,
  title = {Multi-Robot Path Planning with Time Windows and Boolean Specifications},
  author = {Siyu LIU and Syrine Bouazza and Zhou He and Dimitri Lefebvre},
  journal = {Research Square},
  year = {2026},
  doi = {10.21203/rs.3.rs-9708502/v1},
  url = {https://doi.org/10.21203/rs.3.rs-9708502/v1}
}

FAQ

Using this paper in a discovery workflow

How do I find related work for this paper?

Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.

How can I keep up with new Robotic Path Planning Algorithms research papers?

Follow Robotic Path Planning Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.

Can I cite this paper from this page?

This page includes a static BibTeX block for Multi-Robot Path Planning with Time Windows and Boolean Specifications. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.

Follow this research in Scollr

Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.

Get the app