Time-varying environment-based machine learning technique for autonomous agent shortest-path planning
Dalila B. Megherbi, Ahmed Teirelbar, A. J. Boulenouar · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2001
Autonomous agent path planning is a main problem in the fields of machine learning and artificial intelligence. Reactive execution is often used in order to provide best decision for the agent's reactions. Although this problem is important in the stationary environment, most interesting environments are time varying. This paper is based on our previous work focusing on combining the potential field model with reinforcement learning to solve the stationary path problem. In this work we deal with the case of dynamic environment. In the dynamic environment, the motion of the obstacles provides for different problems and challenges, which our proposed algorithm in this paper encounters and addresses.