title: Possibility of implementing Shortest path algorithm with waypoints on webots
body: <p>I'm currently doing a project using Webots to create a 3d simulation world - a container terminal yard whereby multiple robots(AGVs) reach their designated destination to load/unload containers.</p>
  
  <p>Here's a glimpse of what I've been doing for the past few weeks.</p>
  
  <p><a href="http://www.youtube.com/watch?v=Rt6NlGP9wpA" rel="nofollow">http://www.youtube.com/watch?v=Rt6NlGP9wpA</a></p>
  
  <p>The round bubbles you see act as a wireless range to send directions to the AGVs.</p>
  
  <p>Seeing some similar threads on shortest path algorithm like Dijkstra or A* Algorithms, I'm pretty sure it can be done but i was hoping if anyone could perhaps provide some insights whether it's possible? and which algorithm is preferred to use?</p>
  
  <p>Thanks and Regards</p>