RIGIDITY-PRESERVING TEAM PARTITIONS IN MULTIAGENT NETWORKS / Vertex / /
Country
United States / /
Currency
pence / / /
Event
Force Majeure / /
Facility
University of Roma Tre / University of Southern California / STORE C UT / /
Holiday
Assumption / /
IndustryTerm
cut search problem / space search / possible robotic applications / split search / multiagent systems / search correctness / iterative algorithm / k-bipartitioning algorithm / rigid networks / dot product / breadth-first search / graph exploration algorithm / possible solutions / preliminary materials including agent and network / multiagent networks / algorithmic solution / search improvements / pruned search method / graph search / supergraph search mechanism / supergraph search / paper iterative algorithms / multiagent network / improved graph search / recursive search / depth-first search / wireless network optimization / graph search mechanism / robot systems / brute force search / impactful applications / autonomous systems / communication network / bipartition search / search space / collaborative systems / noiseless systems / search mechanism / search phase / cut search / /
Organization
International Federation of Automatic Control / Department of Engineering / USC Viterbi School of Engineering / National Science Foundation / University of Southern California / Los Angeles / World Congress / Italian Ministry of Research and Education / University of Roma Tre / /
Person
Andrea Gasparri / P ROC / Gaurav S. Sukhatme / Giovanni Ulivi / Ryan K. Williams / H. M. Schwartz / /
tcyb-gasparrix.pdf