Motion coordination algorithms resulting from classical geometric optimization problems

MaRDI QIDQ3437096zbMATH OpenFDO

Authors J. Cortés

Publication date 14 May 2007

zbMATH Keywords

nonsmooth analysisproximity graphsVoronoi partitions

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Dynamical systems in control (37N35) Nonsmooth analysis (49J52) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Asymptotic stability in control theory (93D20)

Recommendations

• Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
• Distributed motion constraints for algebraic connectivity of robotic networks
• Coordination and Geometric Optimization via Distributed Dynamical Systems
• Spatially-distributed coverage optimization and control with limited-range interactions
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.

Cited in

(11)

• Vector method of design of sliding motion and simplex algorithms
• Efficient coordinated motion.
• Coordination and Geometric Optimization via Distributed Dynamical Systems
• Efficient motion planning strategies for large-scale sensor networks
• Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
• Discussion on: ``Optimal motion-cueing algorithm using motion system kinematics
• Self-triggered coordination of robotic networks for optimal deployment
• Frameworks with Coordinated Edge Motions
• Quadratic optimization of motion coordination and control
• Optimal two-agent coordination for graph traversal: When is formation travel beneficial?
• Coordinated motion of autonomous vehicles with the use of a distributed gradient algorithm

This page was built for publication: Motion coordination algorithms resulting from classical geometric optimization problems

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