Collision-free robot scheduling

DOI10.1016/J.IC.2025.105294MaRDI QIDQ6982307zbMATH OpenFDO

Authors Duncan Adamson, Nathan Flaherty, Igor Potapov, P. G. Spirakis

Publication date 19 May 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2025.105294

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Deterministic scheduling theory in operations research (90B35)

Cites work

• Collision-free network exploration
• Edge exploration of temporal graphs
• Exploration of k-edge-deficient temporal graphs
• Faster exploration of degree-bounded temporal graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Kernelizing temporal exploration problems
• On exploring always-connected temporal graphs of small pathwidth
• On temporal graph exploration
• Optimizing reachability sets in temporal graphs by delaying
• Parameterised temporal exploration problems
• The temporal explorer who returns to the base
• Traveling salesman problems in temporal graphs
• Two moves per time step make a difference

This page was built for publication: Collision-free robot scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982307)