Designing Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University, Qazvin Branch
2010-02-01
|
| Series: | Journal of Optimization in Industrial Engineering |
| Subjects: | |
| Online Access: | http://www.qjie.ir/article_7_0f536d806b7110e5a38db18daf6a50e9.pdf |