Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/4200
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBharali, Mriganka-
dc.contributor.authorDas, Swarup-
dc.contributor.authorNath, Krishanu-
dc.contributor.authorBera, Manas Kumar-
dc.date.accessioned2023-12-28T11:27:19Z-
dc.date.available2023-12-28T11:27:19Z-
dc.date.issued2023-12-
dc.identifier.citation3rd International Conference On Emerging Electronics and Automation (E2A 2023), Hybrid, NIT Silchar, India, 15th - 17th Dec, 2023en_US
dc.identifier.urihttp://hdl.handle.net/2080/4200-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractPath planning for a mobile robot means devising a feasible, collision-free route between any two points while operating in tough, busy environments. The design of intelligent and efficient path-planning algorithms is critical for mobile robots’ autonomous navigation and operation. In this work, we attempt to improve the classical artificial potential field (APF) path planning algorithm, which suffers from local minima, failing to reach the goal. The virtual obstacle method (VOM) and the perturbation approach, both conceptually based on the APF but operationally different, have been proposed as improvements to tackle the local minima problem. These algorithms’ performance and ability to generate the path to reach the desired goal were examined using simulations, considering different obstacle scenarios with comparative analysis. The outcomes of these simulations are discussed in detail, followed by their limitations.en_US
dc.subjectMobile robotsen_US
dc.subjectnavigationen_US
dc.subjectPath planning algorithmsen_US
dc.subjectArtificial Potential Fielden_US
dc.subjectVirtual Objectsen_US
dc.subjectperturbation methoden_US
dc.titleModified Artificial Potential Field Algorithms for Mobile Robot Path Planningen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2023_MBharali_E2A_Modified.pdf882.6 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.