A prototype of search and rescue robot

摘要

Millions of lives are lost every year as a result of inappropriate search and rescue missions when disasters hit the countries. Given the high demand for an autonomous machine to handle search and rescue operations efficiently, the paper aims to design an autonomous robot able to search the victims and rescue them to safe places if natural calamity hits the country. The proposed paper involves the design of a robot that can localize itself in known environment but the unknown location, find the victims and get them to safe zones. The robot will not only be able to localize itself but also plan the shortest path to pick and drop objects. Localization technique is based on the map-based position method whereas shortest path algorithm is the modified Dijkstra's theorem. This robot enables us to rescue the victims in the shortest time with least harm to rescue units.