Skip to main content

Trajectory Planning for Time-Constrained Agent Synchronization

  • Conference paper
  • First Online:
Robot 2019: Fourth Iberian Robotics Conference (ROBOT 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1092))

Included in the following conference series:

  • 1337 Accesses

Abstract

In the present paper we focus on the problem of synchronizing two agents in movement. An agent, knowing the trajectory of a teammate who it must exchange data with, has to obtain a trajectory to synchronize with this mate before going to its own goal. We develop the trajectory planner for the agent that it is constrained by the time to synchronize with the mate. Firstly, we define the dynamic communication area, produced by a teammate agent in movement, as well as the different parts of this area, used by the proposed planner. Then, we develop a method to obtain trajectories for an agent in order to be able to synchronize with a teammate in movement, whose trajectory is known. Simulated results show that the proposed approach is able to provide the solution according to two chosen criteria: distance or time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amato, N.M., Wu, Y.: A randomized roadmap method for path and manipulation planning. In: Proceedings of IEEE International Conference on Robotics and Automation, vol. 1, pp. 113–120, April 1996

    Google Scholar 

  2. Banfi, J., Li, A.Q., Basilico, N., Rekleitis, I., Amigoni, F.: Asynchronous multirobot exploration under recurrent connectivity constraints. In: 2016 IEEE International Conference on Robotics and Automation (ICRA), pp. 5491–5498, May 2016

    Google Scholar 

  3. Díaz-Bánez, J.M., Caraballo, L.E., Lopez, M.A., Bereg, S., Maza, I., Ollero, A.: A general framework for synchronizing a team of robots under communication constraints. IEEE Trans. Robot. 33(3), 748–755 (2017)

    Article  Google Scholar 

  4. Farinelli, A., Iocchi, L., Nardi, D.: Distributed on-line dynamic task assignment for multi-robot patrolling. Auton. Robot. 41(6), 1321–1345 (2017)

    Article  Google Scholar 

  5. Goldhirsh, J., Vogel, W.: Handbook of propagation effects for vehicular and personal mobile satellite systems, December 1998

    Google Scholar 

  6. Hollinger, G.A., Singh, S.: Multirobot coordination with periodic connectivity: theory and experiments. IEEE Trans. Robot. 28(4), 967–973 (2012)

    Article  Google Scholar 

  7. Joy, K.I.: Breshenham’s algorithm. In: Visualization and Graphics Research Group. Department of Computer Science, University of Carolina, December 1999

    Google Scholar 

  8. Lavalle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Technical report, Department of Computer Science, Iowa State University (1998)

    Google Scholar 

  9. Majcherczyk, N., Jayabalan, A., Beltrame, G., Pinciroli, C.: Decentralized connectivity-preserving deployment of large-scale robot swarms. In: 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4295–4302 (2018)

    Google Scholar 

  10. Marchukov, Y., Montano, L.: Multi-agent coordination for on-demand data gathering with periodic information upload. In: Advances in Practical Applications of Survivable Agents and Multi-Agent Systems: The PAAMS Collection, pp. 153–167. Springer, Cham (2019)

    Chapter  Google Scholar 

  11. Mukhija, P., Krishna, K.M., Krishna, V.: A two phase recursive tree propagation based multi-robotic exploration framework with fixed base station constraint. In: 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4806–4811, October 2010

    Google Scholar 

  12. Portugal, D., Rocha, R.: MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning. In: Proceedings of the 2010 ACM Symposium on Applied Computing, SAC 2010, pp. 1271–1276. ACM (2010)

    Google Scholar 

  13. Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. USA 93(4), 1591–1595 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Yaroslav Marchukov or Luis Montano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Marchukov, Y., Montano, L. (2020). Trajectory Planning for Time-Constrained Agent Synchronization. In: Silva, M., Luís Lima, J., Reis, L., Sanfeliu, A., Tardioli, D. (eds) Robot 2019: Fourth Iberian Robotics Conference. ROBOT 2019. Advances in Intelligent Systems and Computing, vol 1092. Springer, Cham. https://doi.org/10.1007/978-3-030-35990-4_46

Download citation

Publish with us

Policies and ethics