Abstract
In this paper, we exploit an integration between the mobility of robots and the collaboration between them to sample sensing areas that need to be observed. A collaborative and compressed mobile sensing algorithm is proposed for distributed robotic networks to build scalar field maps. In order to move in the sensing field and to avoid collision with obstacles and with each other, a control law is embedded into the robots. At a sampling time, each robot senses and adds data within its sensing range and collaborates to the others by exchanging data with its neighbors. A compressed sensing (CS) measurement created is a sum of scalar values collecting by a connected group of robots. A certain number of CS measurements is required at each robot to reconstruct all sensory readings from points of interest visited by the group of robots. The method reduces significantly data traffic among robots. We further analyze and formulate power consumption for the robots, and suggest some optimal cases for the robot to consume the least power.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
