Traversability, Reconfiguration, and Reachability in the Gadget Framework
Abstract Consider an agent traversing a graph of “gadgets”, where each gadget has local state that changes with each traversal by the agent according to specified rules. Prior work has studied the computational complexity of deciding whether the agent can reach a specified location, a p...
| Main Authors: | , , , , |
|---|---|
| 其他作者: | |
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Springer US
2023
|
| 在线阅读: | https://hdl.handle.net/1721.1/151069 |