Path planning for data collection robot in sensing field with obstacles
AbstractUsing mobile robots to collect data from wireless sensor network can reduce energy dissipation and this way improves network lifetime. Our problem is to plan paths for unicycle robots to visit a set of sensor nodes and download data on a sensing field with obstacles while minimizing the path length and the collecting time. Reconstructing the path of an intruder in a guarded area is also a possible application of this technology. During path planning we greatly emphasize the handling of obstacles. If the area contains many or large obstacles, the robots may spend long time for avoid them so this is a critical point of finding the minimal path. This paper proposes a new approach for handling obstacles during path planning. A new algorithm is developed to plan the visiting sequence of nodes taking into consideration the obstacles as well.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).