Title:
Graph Process Specifications for Hybrid Networked Systems
Graph Process Specifications for Hybrid Networked Systems
Files
Author(s)
Twu, Philip Y.
Martin, Patrick
Egerstedt, Magnus B.
Martin, Patrick
Egerstedt, Magnus B.
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
Many large-scale multi-agent missions consist of a sequence of subtasks, each of which can be accomplished separately by having agents execute appropriate decentralized controllers. However, many decentralized controllers have network topological prerequisites that must be satisfied in order to achieve the desired effect on a system. Therefore, one cannot always hope to accomplish the original mission by having agents naively switch through executing the controllers for each subtask. This paper extends the Graph Process Specification (GPS) framework, which was presented in previous work as a way to script decentralized control sequences for agents, while ensuring that network topological requirements are satisfied when each controller in the sequence is executed. Atoms, the fundamental building blocks in GPS, each explicitly state a network topological transition. Moreover, they specify the means to make that transition occur by providing a multi-agent controller, as well as a way to locally detect the transition. Scripting a control sequence in GPS therefore reduces to selecting a sequence of atoms from a library to satisfy network topological requirements, and specifying interrupt conditions for switching. As an example of how to construct an atom library, the optimal decentralization algorithm is used to generate atoms for agents to track desired multi-agent motions with when the network topology is static. The paper concludes with a simulation of agents performing a drumline-inspired dance using decentralized controllers generated by optimal decentralization and scripted using GPS.
Sponsor
Date Issued
2012-12
Extent
Resource Type
Text
Resource Subtype
Article
Pre-print
Pre-print