Backend
A complete analytical characterization of optimal collision-free motion for two robots
arXiv cs.RO0 views
arXiv:2610.41558v1 Announce Type: new Abstract: Collision-free motion planning for multi-agent robotic systems remains an active research area because of the complexity of coordinating robot trajectories, with applications ranging from coordinated drone shows to autonomous operations on land, in the air, and on water. Importantly, the analytical difficulty of nonconvex collision-avoidance constraints has so far driven the development of exclusively numerical methods. We derive a complete analytical characterization of the optimal trajectories for two robots that start and end at rest, under double-integrator dynamics and a squared-acceleration objective. We prove that these trajectories belong to eight distinct contact families and determine which family applies for each configuration of initial and final positions. We analyze the geometrical properties of the optimal trajectories, provide a numerical algorithm for computing them, and discuss how these insights may improve the performance of existing numerical trajectory optimizers.
Source:https://arxiv.org/abs/2610.41558PreviousContact-based optimization for collision-free motion planning for a million robotsNextVLA Policies Do Not Know When Not to Act: Unintended Task Execution and Start Suppression
Related posts
The Verdict Compiler: Pre-Registering a 90-Minute Spike
0dev.to
Reviewing an Agent PR That Adds Request Coalescing: The Colliding Cache Key, the Test That Lied, and the Meter That Double-Charged
0dev.to
Portability Before Spill: A Two-Path Conformance Harness for Local-First Agents
0dev.to
Social media uploads without an API: an uploader that drives the browser
0dev.to
Benchmark Budgets Are Part of the Grader: A Paired Cost and Latency Gate for AI C++ Patches
0dev.to
Split Your Docs by Claim Type, Not by Section Size: A Manifest That Decides What a Model May Draft
0dev.to