Abstract
In this paper the authors discuss a path planning problem for an autonomous robot-trailer system, while also including some consideration for the physical dimension of the trailer. The trailer equipped with sensing equipments is used to perform a surveillance mission among a collection of waypoint neighborhoods. The concept of a neighborhood is used to model the physical size of the actual sensors on the trailer. The problem is modeled as a Dubins Traveling Salesman Problem with Neighborhoods (DTSPN), where the neighborhoods are represented by disks. The authors firstly design a new algorithm for the Traveling Salesman Problem with Neighborhoods (TSPN), then extend this algorithm to find the shortest path for the DTSPN. The numerical study shows that the proposed algorithm can perform very well for both disjoint and overlapped disks cases.
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.
