Optimising Wheelchair Path Planning
摘要
This article addresses the problem of wheelchair path planning. In particular, to minimize the length of the trajectory within an environment containing a variable number of obstacles. The positions and quantities of these obstacles are pre-determined. To tackle this challenge, we present a methodology that integrates optimisation techniques and heuristic algorithms to find trajectories both optimal and collision-free. The effectiveness of this methodology is illustrated through a practical example, demonstrating how it successfully generates a collision-free trajectory, even when a large number of obstacles is present in the workspace. In the future, we intend to continue investigating the same problem, taking into account energy consumption as well as time minimisation.