Main Article Content

Sudipta Biswas


In this paper a method has been proposed to identify the lowest cost path to reach a destination point from a source point. However, unlike most of the colloquial graph traversal problems, here the destination point is dynamic— not ï¬xed, i.e. changes its position with time. This causes the chaser to update its path planning accordingly, by constantly sensing the position of the destination. During the progression, the chaser may has to side-track many obstacles, for which, in addition to the algorithm for reaching dynamic target through optimal path, two techniques have also been proposed for avoiding obstacles. The proposed method has been compared with the existing techniques for reaching dynamic target such as D*, D* Lite etc. and also with the existing obstacle avoidance techniques such as Bug, NHNA etc., mainly used in Robotics.


Download data is not yet available.

Article Details



M. S. Ganeshmurthy, G. R. Suresh, Path planning algorithm for autonomous mobile robot in dynamic environment, 3rd International Conference on Signal Processing, Communication and Networking (ICSCN), pp 1-6, DOI: 10.1109/ICSCN.2015.7219901, IEEE Conference Publications, March 2015

Luyi Shen et. al., Multi-swarm Optimization with Chaotic Mapping for Dynamic Optimization Problems, , 8th International Symposium on Computational Intelligence and Design (ISCID), pp 132-137, DOI: 10.1109/ISCID.2015.173,IEEE Conference Publications, 2015

M. Gracia et. al., Dynamic Graph-Search algorithm for Global Path Planning in Presence of Hazardous Weather, Journal of Intelligent & Robotic Systems with a special section on Unmanned Systems,Springer Science+ Business Media B.V., 2012

Seohyun Jeon et. al., Cooperative Multi-robot Searching Algorithm, Proceedings of the 12th International Conference - Intelligent Autonomous Systems IAS-12, Volume 2, pp. 749-756, Springer-Verleg Berlin Heidelberg, 2013

Jinpyo Hong et. al, A new mobile robot navigation using a turning point searching algorithm with the consideration of obstacle avoidance, The International Journal of Advanced Manufacturing Technology, Springer-Verleg London Limited, 2010

M. Zohaib, M. Pasha, R. A. Riaz, N. Javaid1, M. Ilahi, R. D. Khan ,Control Strategies for Mobile Robot With Obstacle Avoidance,Journal of Basic and Applied Scientiï¬c Research (JBASR) 3 (4), pp.- 1027-1036, 2013

Steven Bell, An Overview of Optimal Graph Search Algorithms for Robot Path Planning in Dynamic or Uncertain Environments , Proceedings of Student Paper Contest, Institute of Electrical and Electronics Engineers Conference, Oklahoma, March, 2010

Sven Koenig ,Maxim Likhachev, D* Lite , Proceeding Eighteenth national conference on Artiï¬cial intelligence, American Association for Artiï¬cial Intelligence, pp 476-483, Menlo Park, CA, USA, 2002

Sven Koenig, Maxim Likhachev, Fast Replanning for Navigation in Unknown Terrain, IEEE Transactions on Robotics (TRO), 21(3), pp. 354-363, 2005

Sven Koenig, Maxim Likhachev, David Furcy, Lifelong Planning A*, Journal Artiï¬cial Intelligence, Volume 155 Issue 1-2, pp 93 - 146, Elsevier Science Publishers Ltd. Essex, UK, May 2004

H. Dehmeshki, W. Stuerzlinger, Design and Evaluation of a Perceptual-based Object Group Selection Technique, British HCI 2010, ISBN 978-178017130-2, 365-372, Sept. 2010.