DocumentCode
2276340
Title
Network configuration control via connectivity graph processes
Author
Muhammad, Abubakr ; Egerstedt, Magnus
Author_Institution
Dept. of Electr. & Syst. Eng., Pennsylvania Univ., Philadelphia, PA
fYear
2006
fDate
14-16 June 2006
Abstract
In this paper, we discuss how to generate trajectories, modeled as connectivity graph processes, on the space of graphs induced by the network topology. We discuss the role of feasibility, reachability, and optimality in this context. In particular, we study in detail the role of reachability and the computation of reachable sets by using the cylindrical algebraic decomposition (CAD) algorithm
Keywords
multi-agent systems; reachability analysis; set theory; connectivity graph; cylindrical algebraic decomposition; feasibility; graph spaces; network configuration control; network topology; optimality; reachable sets; Autonomous agents; Computer networks; Heart; Large-scale systems; Mobile agents; Network topology; Production; Space exploration; Space technology; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2006
Conference_Location
Minneapolis, MN
Print_ISBN
1-4244-0209-3
Electronic_ISBN
1-4244-0209-3
Type
conf
DOI
10.1109/ACC.2006.1656408
Filename
1656408
Link To Document