pith. sign in

arxiv: math/0501499 · v1 · submitted 2005-01-28 · 🧮 math.OC

Synchronous robotic networks and complexity of control and communication laws

classification 🧮 math.OC
keywords communicationcontrolroboticcomplexitycoordinationnetworkagentsalgorithms
0
0 comments X
read the original abstract

This paper proposes a formal model for a network of robotic agents that move and communicate. Building on concepts from distributed computation, robotics and control theory, we define notions of robotic network, control and communication law, coordination task, and time and communication complexity. We then analyze a number of basic motion coordination algorithms such as pursuit, rendezvous and deployment.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.