A Scalable Information Theoretic Approach to Distributed Robot Coordination
This paper presents a scalable information theoretic approach to infer the state of an environment by distributively controlling robots equipped with sensors. The robots iteratively estimate the environment state using a recursive Bayesian filter, while continuously moving to improve the quality of...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Language: | en-US |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/1721.1/64821 |
| _version_ | 1826195234210447360 |
|---|---|
| author | Julian, Brian J. Angermann, Michael Schwager, Mac Rus, Daniela |
| author2 | Daniela Rus |
| author_facet | Daniela Rus Julian, Brian J. Angermann, Michael Schwager, Mac Rus, Daniela |
| author_sort | Julian, Brian J. |
| collection | MIT |
| description | This paper presents a scalable information theoretic approach to infer the state of an environment by distributively controlling robots equipped with sensors. The robots iteratively estimate the environment state using a recursive Bayesian filter, while continuously moving to improve the quality of the estimate by following the gradient of mutual information. Both the filter and the controller use a novel algorithm for approximating the robots' joint measurement probabilities, which combines consensus (for decentralization) and sampling (for scalability). The approximations are shown to approach the true joint measurement probabilities as the size of the consensus rounds grows or as the network becomes complete. The resulting gradient controller runs in constant time with respect to the number of robots, and linear time with respect to the number of sensor measurements and environment discretization cells, while traditional mutual information methods are exponential in all of these quantities. Furthermore, the controller is proven to be convergent between consensus rounds and, under certain conditions, is locally optimal. The complete distributed inference and coordination algorithm is demonstrated in experiments with five quad-rotor flying robots and simulations with 100 robots. |
| first_indexed | 2024-09-23T10:09:31Z |
| id | mit-1721.1/64821 |
| institution | Massachusetts Institute of Technology |
| language | en-US |
| last_indexed | 2024-09-23T10:09:31Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | mit-1721.1/648212019-04-12T13:27:15Z A Scalable Information Theoretic Approach to Distributed Robot Coordination Julian, Brian J. Angermann, Michael Schwager, Mac Rus, Daniela Daniela Rus Robotics (Rus) This paper presents a scalable information theoretic approach to infer the state of an environment by distributively controlling robots equipped with sensors. The robots iteratively estimate the environment state using a recursive Bayesian filter, while continuously moving to improve the quality of the estimate by following the gradient of mutual information. Both the filter and the controller use a novel algorithm for approximating the robots' joint measurement probabilities, which combines consensus (for decentralization) and sampling (for scalability). The approximations are shown to approach the true joint measurement probabilities as the size of the consensus rounds grows or as the network becomes complete. The resulting gradient controller runs in constant time with respect to the number of robots, and linear time with respect to the number of sensor measurements and environment discretization cells, while traditional mutual information methods are exponential in all of these quantities. Furthermore, the controller is proven to be convergent between consensus rounds and, under certain conditions, is locally optimal. The complete distributed inference and coordination algorithm is demonstrated in experiments with five quad-rotor flying robots and simulations with 100 robots. This work is sponsored by the Department of the Air Force under Air Force contract number FA8721-05-C-0002. The opinions, interpretations, recommendations, and conclusions are those of the authors and are not necessarily endorsed by the United States Government. This work is also supported in part by ARO grant number W911NF-05-1-0219, ONR grant number N00014-09-1-1051, NSF grant number EFRI-0735953, ARL grant number W911NF-08-2-0004, MIT Lincoln Laboratory, the European Commission, and the Boeing Company. 2011-07-15T17:15:17Z 2011-07-15T17:15:17Z 2011-09-25 http://hdl.handle.net/1721.1/64821 In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS 11) en-US MIT-CSAIL-TR-2011-034 10 p. application/pdf |
| spellingShingle | Julian, Brian J. Angermann, Michael Schwager, Mac Rus, Daniela A Scalable Information Theoretic Approach to Distributed Robot Coordination |
| title | A Scalable Information Theoretic Approach to Distributed Robot Coordination |
| title_full | A Scalable Information Theoretic Approach to Distributed Robot Coordination |
| title_fullStr | A Scalable Information Theoretic Approach to Distributed Robot Coordination |
| title_full_unstemmed | A Scalable Information Theoretic Approach to Distributed Robot Coordination |
| title_short | A Scalable Information Theoretic Approach to Distributed Robot Coordination |
| title_sort | scalable information theoretic approach to distributed robot coordination |
| url | http://hdl.handle.net/1721.1/64821 |
| work_keys_str_mv | AT julianbrianj ascalableinformationtheoreticapproachtodistributedrobotcoordination AT angermannmichael ascalableinformationtheoreticapproachtodistributedrobotcoordination AT schwagermac ascalableinformationtheoreticapproachtodistributedrobotcoordination AT rusdaniela ascalableinformationtheoreticapproachtodistributedrobotcoordination AT julianbrianj scalableinformationtheoreticapproachtodistributedrobotcoordination AT angermannmichael scalableinformationtheoreticapproachtodistributedrobotcoordination AT schwagermac scalableinformationtheoreticapproachtodistributedrobotcoordination AT rusdaniela scalableinformationtheoreticapproachtodistributedrobotcoordination |