Path planning for multiagent system in a sensing field with obstacles and multiple base stations

Authors

  • Sára Olasz-Szabó Dept. of Control Engineering and Information Technology, Budapest University of Technology and Economics, Budapest, Hungary
  • István Harmati

DOI:

https://doi.org/10.21014/actaimeko.v13i4.1572

Keywords:

path planning, mobile robots, obstacle avoidance, multiagent system, ant colony optimalization, data collection

Abstract

In large area data collection, wireless long-distance data transmission through sensor network reduces network lifetime due to large energy consumption. Therefore, this paper presents a path planning problem for a multiagent system to periodically visit a set of sensor nodes in a sensing field with obstacles while minimizing the data collection time. During data collection, all sensor nodes are visited in each period exactly once by the robots. At the end of one period the collected data is uploaded to one of the base stations. This paper proposes a new approach for constructing clusters and a visiting sequence of nodes, that each robot must visit. To design the clusters and the visiting sequence of nodes a new algorithm based on Ant Colony Optimization is developed. The path planning algorithms from one and multiple base stations are created. Simulations are conducted in various sensing fields with different numbers of agents, measurements are defined, and the results are analyzed. The created algorithms can be utilized for example, to monitor weather phenomena in an agricultural area or reconstructing the path of an intruder in a guarded area.

 

Downloads

Published

2024-11-25

Issue

Vol. 13 No. 4 (2024)

Section

Research Papers

License

Copyright (c) 2024 Sára Olasz-Szabó, István Harmati

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under the CC BY 4.0, Creative Commons Attribution 4.0 International License.

Users are free to

  • share, i.e. copy and redistribute the material in any medium or format for any purpose, even commercially;
  • adapt, i.e. remix, transform, and build upon the material for any purpose, even commercially.

At the same time, the user must give appropriate credit, provide a link to the license, and indicate if changes were made.
Additional information about the license can be found at: https://creativecommons.org/licenses/by/4.0/.

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.
  • 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).