Partitioning algorithms for multi-agent systems based on finite-time proximity metrics

DOI10.1016/j.automatica.2015.03.011zbMath1377.93011OpenAlexW1979937625MaRDI QIDQ1689365

Efstathios Bakolas

Publication date: 12 January 2018

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2015.03.011

zbMATH Keywords

computational methodsautonomous agentsVoronoi diagramsfinite-time controlpartitioning algorithms

Mathematics Subject Classification ID

Decentralized systems (93A14) Agent technology and artificial intelligence (68T42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decentralized spatial partitioning for multi-vehicle systems in spatiotemporal flow-field
• The Zermelo-Voronoi diagram: a dynamic partition problem
• Finite-time control for robot manipulators
• Non-singular terminal sliding mode control of rigid manipulators
• Optimal partitioning for multi-vehicle systems using quadratic performance criteria
• Optimal partitioning for spatiotemporal coverage in a drift field
• Continuous finite-time control for robotic manipulators with terminal sliding mode
• Coverage control in constant flow environments based on a mixed energy-time metric
• Finite-Time Stability of Continuous Autonomous Systems

This page was built for publication: Partitioning algorithms for multi-agent systems based on finite-time proximity metrics