Due to an ever increasing inclusion of people into the workspace of robots, the demand arose for a reliable algorithm that is capable of obstacle detection and avoidance. To fulfill that demand, a group of predictive control algorithms were developed that can predict collisions with objects and divert the robot in order to avoid them.
The algorithm I present in this thesis is based on the more widely known dynamic window and trajectory rollout algorithms and tries to correct their flaws. The number of additional possible paths is increased and so are their branching options. I added a time delay compensation to compensate for the time difference between the capture of localization data and their usage in the algorithm. Besides the base cost parameters of distance to goal and path following error, two new were added. The costs of translational and angular velocity change, help increase the users control over the dynamics of the robot.
I tested the algorithm both in the Gazebo simulation environment software and in a real environment with a mobile robot developed by the company Epilog d.o.o.
The simulation was first used to test the basic functionalities of the algorithm and later its ability to avoid static obstacles. With the real robot, we performed tests that determined if it could travel from point A to B, avoid static obstacles and avoid a moving person.
In the conclusion I describe all the major flaws of the algorithm and ways to improve it.
|