Obtaining the collision-free path for the biped walking machine/robot in an obstacle clustered environment is a challenging task. To overcome this difficulty, researchers around the world are implementing several collision-free path planning algorithms. It is significant to note that an effective path-planning methodology helps the biped robot to achieve a collision-free path with a minimum travel path. In the current investigation, the authors have proposed a new path planning procedure, that is, Fast Sweeping Method (FSM), to obtain the optimal path for the biped robot in a static environment. To check the effectiveness of the developed procedure, in the present investigation, the authors have tested it in both simulations as well as on an actual biped robot in a static domain. Further, the results of the current algorithm are compared with two established path planning algorithms, namely the Fast Marching Method (FMM) and A-star algorithms. In the end, it has been detected that the proposed algorithm obtains the best collision-free optimal path when compared with the Fast Marching Method (FMM) and A-star algorithms.
FergusonDStentzA. Field D*: An interpolation-based path planner and replanner. In: Robotics research. Berlin, Heidelberg: Springer; 2007, pp. 239–253.
7.
QureshiAHAyazY. Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Robotics Autonomous Syst2015; 68: 1–11.
8.
WangYChirikjianGS. A new potential field method for robot path planning. Symposia Proc (Cat. No. 00CH37065). Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation, Vol. 2. San Francisco, CA, USA, IEEE, 2000. 977–982.
9.
LaminiCBenhlimaSElbekriA. Genetic algorithm based approach for autonomous mobile robot path planning. Proced Computer Sci2018; 127: 180–189.
10.
NasrollahyAZJavadiHHS. Using particle swarm optimization for robot path planning in dynamic environments with moving obstacles and target. In: 2009 Third UKSim European Symposium on Computer Modeling and Simulation. Athens, Greece, IEEE; 2009, pp. 60–65.
11.
MiaoHTianY-C. Dynamic robot path planning using an enhanced simulated annealing approach. Appl Maths Comput2013; 222: 420–437.
12.
PandaMRDasPPradhanS. Hybridization of IWO and IPSO for Mobile Robots Navigation in a Dynamic Environment. Journal of King Saud University-Computer and Information Sciences, Saudi Arabia: Elsevier, 2017.
13.
YangSXMengM. An efficient neural network approach to dynamic robot motion planning. Neural Networks2000; 13(2): 143–148.
14.
LeeTLWuCJ. Fuzzy motion planning of mobile robots in unknown environments. J Intell Robotic Syst2003; 37(2): 177–191.
15.
MrudulKMandavaRKVundavilliPR. An Efficient Path Planning Algorithm for Biped Robot using Fast Marching Method. Proced Computer Science2018; 133: 116–123.
16.
StentzA. The focussed d^* algorithm for real-time replanning. IJCAI1995; 95: 1652–1659.
17.
DuchonFBabinecAMartinK, et al. Path planning with modified A star algorithm for a mobile robot. Model Mech Mechatronic Syst MMaMS2014; 96: 59–69.
18.
LiGTamuraYYamashitaA, et al. Effective improved artificial potential field-based regression search method for autonomous mobile robot path planning. Int J Mechatronics Automation2013; 3(3): 141–170.
19.
MandavaRKBondadaSVundavilliPR. An optimized path planning for the mobile robot using potential field method and PSO algorithm. Adv Intell Syst Comput. In: Soft Computing for Problem Solving. Singapore: Springer; 2019, pp. 139–150.
20.
SethianJA. A fast marching level set method for monotonically advancing fronts. Proc Natl Acad Sci1996; 93(4): 1591–1595.
21.
JansonLSchmerlingEClarkA, et al. Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions. Int Journal Robotics Research2015; 34(7): 883–921.
22.
GarridoSMorenoLGómezJV, et al. General path planning methodology for leader-follower robot formations. Int J Adv Robotic Syst2013; 10(1): 64.
23.
Valero-GomezAGomezJVGarridoS, et al. The Path to Efficiency: Fast Marching Method for Safer, More Efficient Mobile Robot Trajectories. IEEE Robotics Automation Mag2013; 20: 111–120.
24.
GarridoSMorenoLBlancoD. Exploration of a cluttered environment using voronoi transform and fast marching. Robotics Autonomous Syst2008; 56(12): 1069–1081.
25.
PetresCPailhasYPetillotY, et al. Underwater path planing using fast marching algorithms. Europe Oceans 2005, Vol. 2. Brest, France, IEEE, 2005, pp. 814–819.
26.
LiGTamuraYYamashitaA, et al. Effective improved artificial potential field-based regression search method for autonomous mobile robot path planning. Int J Mechatronics Automation2013; 3(3): 141–170.
27.
MandavaRKKatlaMVundavilliPR. Application of hybrid fast marching method to determine the real-time path for the biped robot. Intell Serv Robotics2019; 12(1): 125–136.
28.
KashyapAKParhiDRMuniMK, et al. A hybrid technique for path planning of humanoid robot NAO in static and dynamic terrains. Appl Soft Comput2020; 96: 106581.
29.
DeepakBBVLParhiDRRajuBMVA. Advance particle swarm optimization-based navigational controller for mobile robot. Arabian J Sci Eng2014; 39(8): 6477–6487.
30.
BakJ-HHwangSWYoonJ, et al. Collision-free path planning of cable-driven parallel robots in cluttered environments. Intell Serv Robotics2019; 12(3): 243–253.
31.
KimCSuhJHanJ-H. Development of a hybrid path planning algorithm and a bio-inspired control for an omni-wheel mobile robot. Sensors2020; 20(15): 4258.
32.
DebnathSKOmarRBagchiS, et al. Different Cell Decomposition Path Planning Methods for Unmanned Air Vehicles-A Review. In: Proceedings of the 11th National Technical Seminar on Unmanned System Technology 2019. Lecture Notes Electr Eng. Singapore: Springer; 2021, pp. 99–111.
33.
KashyapAKParhiDR. Optimization of stability of humanoid robot NAO using ant colony optimization tuned MPC controller for uneven path. Soft Comput2021; 25(7): 5131–5150.
34.
DeepakBBVLBahubalendruniMR. Development of a path follower in real-time environment. World J Eng2017.
35.
KumarGABahubalendruniMRPrasadVV, et al. A novel Geometric feasibility method to perform assembly sequence planning through oblique orientations. Engineering Science and Technology. An Int J2021.
36.
ZhaoH. Parallel implementations of the fast sweeping method. J Comput Maths2007; 25(4): 421–429.
37.
ZhaoH-KOsherSMerrimanB, et al. Implicit and nonparametric shape reconstruction from unorganized data using a variational level set method. Computer Vis Image Understanding2000; 80(3): 295–314.
38.
ZhaoH. A Fast Sweeping Method Eikonal Equations2004; 74(No.250): 603–627.
39.
MandavaRKMrudulKVundavilliPR. Dynamic motion planning algorithm for a biped robot using fast marching method hybridized with regression search. Acta Polytech Hung2019; 16: 189–208.
40.
InkuluAKBahubalendruniMRDaraA, et al. Challenges and Opportunities in Human Robot Collaboration Context of Industry 4.0-a State of the Art Review, Ind Robot: The International Journal Robotics Research Application. Emerald Publishing Limited, 2021.
