Abstract
Four path planning and data exchange algorithms for cooperative search and coverage robotic missions are proposed and modified. The introduced methods are simulated using C++ programming environment and the results are discussed in detail for environments with static obstacles. It has been shown that using the nearest zero-point algorithm can greatly optimise the mission duration and also overlapping of the search trajectories. Finally, the results are compared with several existing algorithms.
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.
