Abstract
As a high-risk occupation, firefighters are exposed to huge challenges and dangers in extinguishing fires and performing rescue operations. Therefore, many firefighter robots are being designed and deployed to firefighting operations and promote the efficiency while protecting the human operators. There are already studies on the implementation of mobile fire-fighting robots, but how to plan an efficient route in the case of multiple fire spots still needs further research. In this work, we propose a greedy-algorithm-based route planner and calculate the best route to visit each fire spot with the shortest time, by formulating the problem as a traveling salesman problem (TSP). We validate the proposed idea by using a mobile robot, namely redbot, and present the test results.
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.
