PROJECT TITLE :

Robot Control Strategies for Task Allocation with Connectivity Constraints in Wireless Sensor and Robot Networks - 2018

ABSTRACT:

Mobility at intervals Wireless Sensor Networks (WSNs) has been widely thought of for information collection tasks, where mobile robots physically collect the information from the sensors and return to the bottom station. Although this approach has proven to be helpful in prolonging the lifetime of these networks, it cannot meet the necessities of real-time knowledge assortment tasks. For such tasks, we have a tendency to want to utilize mobile robots to create a connected path from the base station to the event, with use in-network forwarding through that path. This can offer a longer lifetime while addressing efficiency and scalability issues because mobile robots have a bigger and renewable energy reserve, a extended transmission range, and capacity. One of the basic issues is how to coordinate robots to determine a connected path from the event location to the base station. We think about this fundamental downside with 2 objectives, specifically minimizing distance traveled by the robots and minimizing hop count (the quantity of robots used on methods) below the constraints of satisfying the trail and/or network connectivity. Once mathematically formulating the underlying issues and discussing their NP-hardness, we tend to propose numerous heuristic solutions. We tend to then demonstrate the efficacy of our proposed solutions through in depth simulations.