A Novel Collision-Free Homotopy Path Planning for Planar Robotic Arms
Gerardo C. Velez-Lopez,
Hector Vazquez-Leal,
Luis Hernandez-Martinez,
Arturo Sarmiento-Reyes,
Gerardo Diaz-Arango,
Jesus Huerta-Chua,
Hector D. Rico-Aniles,
Victor M. Jimenez-Fernandez
Affiliations
Gerardo C. Velez-Lopez
Electronics Department, National Institute for Astrophysics, Optics and Electronics, Luis Enrique Erro 1, Santa María Tonantzintla, Cholula 72840, Puebla, Mexico
Hector Vazquez-Leal
Facultad de Instrumentacion Electronica, Universidad Veracruzana, Cto. Gonzalo Aguirre Beltran S/N, Xalapa 91000, Veracruz, Mexico
Luis Hernandez-Martinez
Electronics Department, National Institute for Astrophysics, Optics and Electronics, Luis Enrique Erro 1, Santa María Tonantzintla, Cholula 72840, Puebla, Mexico
Arturo Sarmiento-Reyes
Electronics Department, National Institute for Astrophysics, Optics and Electronics, Luis Enrique Erro 1, Santa María Tonantzintla, Cholula 72840, Puebla, Mexico
Gerardo Diaz-Arango
Instituto Tecnologico Superior de Poza Rica, Tecnologico Nacional de Mexico, Luis Donaldo Colosio Murrieta S/N, Poza Rica 93230, Veracruz, Mexico
Jesus Huerta-Chua
Instituto Tecnologico Superior de Poza Rica, Tecnologico Nacional de Mexico, Luis Donaldo Colosio Murrieta S/N, Poza Rica 93230, Veracruz, Mexico
Hector D. Rico-Aniles
Electrical Engineering Department, North Central College, 30 N. Brainard St., Naperville, IL 60540, USA
Victor M. Jimenez-Fernandez
Facultad de Instrumentacion Electronica, Universidad Veracruzana, Cto. Gonzalo Aguirre Beltran S/N, Xalapa 91000, Veracruz, Mexico
Achieving the smart motion of any autonomous or semi-autonomous robot requires an efficient algorithm to determine a feasible collision-free path. In this paper, a novel collision-free path homotopy-based path-planning algorithm applied to planar robotic arms is presented. The algorithm utilizes homotopy continuation methods (HCMs) to solve the non-linear algebraic equations system (NAES) that models the robot’s workspace. The method was validated with three case studies with robotic arms in different configurations. For the first case, a robot arm with three links must enter a narrow corridor with two obstacles. For the second case, a six-link robot arm with a gripper is required to take an object inside a narrow corridor with two obstacles. For the third case, a twenty-link arm must take an object inside a maze-like environment. These case studies validated, by simulation, the versatility and capacity of the proposed path-planning algorithm. The results show that the CPU time is dozens of milliseconds with a memory consumption less than 4.5 kB for the first two cases. For the third case, the CPU time is around 2.7 s and the memory consumption around 18 kB. Finally, the method’s performance was further validated using the industrial robot arm CRS CataLyst-5 by Thermo Electron.