TRAJECTORY PLANNING FOR A MOBILE AGENT USING METAHEURISTICS ALGORITHMS
1 University of Jos: Electrical & Electronic Engineering department, Jos – Nigeria
* Corresponding author: imaml@unijos.edu.ng
* Corresponding author: imaml@unijos.edu.ng
Abstract
This paper presents an optimal path planning technique for a mobile robot in a dynamicenvironment. One of the major problems in robotics engineering is motion planning. Sincerobots are not intelligent and have no intelligent means of perceiving its environment, itusually fundamental to develop an obstacle free path capable of guiding the robot from agoal point to a target point. Therefore, this paper presents a computational base model forrobot path planning in a dynamic obstacle environment. The simulation scenario wasformulated with a constrained robot position and an unknown obstacle position. Simulationwere carried out in Matlab R017a and results showed that the proposed method is efficientin comparison with previous techniques.
Keywords
Dynamic Environment Robot Path Planning
Smell Detection Agent Smell Agent Optimization Trajectory Planning
How to Cite
Imam, M. L., Egbujo, I. F., Nyabvo, P. J., Cinfwat, K. Z., Momoh, I. S., & Akut, E. K. (2020). TRAJECTORY PLANNING FOR A MOBILE AGENT USING METAHEURISTICS ALGORITHMS. Zaria Journal of Electrical Engineering Technology, 9(1), 135-138. https://doi.org/10.67203/zjeet.2020.aefwx09o
M. L. Imam, I. F. Egbujo, P. J. Nyabvo, K. Z. Cinfwat, I. S. Momoh, and E. K. Akut, "TRAJECTORY PLANNING FOR A MOBILE AGENT USING METAHEURISTICS ALGORITHMS," Zaria Journal of Electrical Engineering Technology, vol. 9, no. 1, pp. 135-138, September 2020. doi: 10.67203/zjeet.2020.aefwx09o
