Distributed Computing – IWDC 2005
From MaRDI portal
Recommendations
- Distributed Models and Algorithms for Mobile Robot Systems
- Distributed coordination theory for robot teams
- Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots
- scientific article; zbMATH DE number 2080911
- Multi-group coordination control for robot swarms
Cited in
(33)- Distributed formation for robotic swarms considering their crossing motion
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Probability pooling for dependent agents in collective learning
- On fast pattern formation by autonomous robots
- Mutual visibility on grid by asynchronous luminous robots
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Robot algorithms for localization of multiple emission sources
- Optimum Gathering of Asynchronous Robots
- Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots
- Equal-Area Locus-Based Convex Polygon Decomposition
- Multi-group coordination control for robot swarms
- Keeping Mobile Robot Swarms Connected
- A swarm of robots using RFID tags for synchronization and cooperation
- Decentralized swarm coordination: a combined coverage/connectivity approach
- Distributed control of compact formations for multi-robot swarms
- Leader election and gathering for asynchronous fat robots without common chirality
- Coordinating Swarms of Objects at Extreme Dimensions
- Multi-robot redeployment control for enhancing wireless networking quality
- Mutual visibility by luminous robots without collisions
- SWARM INTELLIGENCE SYSTEMS USING GUIDED SELF-ORGANIZATION FOR COLLECTIVE PROBLEM SOLVING
- Distributed Models and Algorithms for Mobile Robot Systems
- Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
- Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
- The mutual visibility problem for fat robots
- The mutual visibility problem for fat robots with lights
- Infinite grid exploration with synchronous myopic robots without chirality
- Pattern formation for fat robots with memory
- Pattern formation for fat robots with lights
- Getting close without touching: near-gathering for autonomous mobile robots
- Autonomous mobile robots with lights
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Coordinated motion of autonomous vehicles with the use of a distributed gradient algorithm
This page was built for publication: Distributed Computing – IWDC 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491761)
