JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Matebese, Belinda
|
|
| dc.contributor.author | Withey, Daniel
|
|
| dc.contributor.author | Banda, M.K. (Mapundi)
|
|
| dc.date.accessioned | 2018-11-15T06:10:13Z | |
| dc.date.issued | 2018-03 | |
| dc.description.abstract | The problem of determining an optimal trajectory for an autonomous mobile robot in an environment with obstacles is considered. The Leapfrog approach is used to solve the ensuing system of equations derived from the first-order optimality conditions of the Pontryagin’s Minimum Principle. A comparison is made between a case in which the classical Newton Method and the Modified Newton Method are used in the shooting method for solving the two-point boundary value problem in the inner loop of the Leapfrog algorithm. It can be observed that with this modification there is an improvement in the convergence rate of the Leapfrog algorithm in general. | en_ZA |
| dc.description.department | Mathematics and Applied Mathematics | en_ZA |
| dc.description.embargo | 2019-03-20 | |
| dc.description.librarian | hj2018 | en_ZA |
| dc.description.uri | http://www.springer.comseries/11156 | en_ZA |
| dc.identifier.citation | Matebese B., Withey D., Banda M.K. (2018) Modified Newton’s Method in the Leapfrog Method for Mobile Robot Path Planning. In: Dash S., Naidu P., Bayindir R., Das S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 668, pp. 71-78. Springer, Singapore. | en_ZA |
| dc.identifier.issn | 2194-5357 (print) | |
| dc.identifier.issn | 2194-5365 (online) | |
| dc.identifier.other | 10.1007/978-981-10-7868-2_7 | |
| dc.identifier.uri | http://hdl.handle.net/2263/67266 | |
| dc.language.iso | en | en_ZA |
| dc.publisher | Springer | en_ZA |
| dc.rights | © Springer Nature Singapore Pte Ltd. 2018. The original publication is available at http://www.springer.comseries/11156. | en_ZA |
| dc.subject | Evolutionary algorithms | en_ZA |
| dc.subject | Two point boundary value problems | en_ZA |
| dc.subject | Optimal trajectories | en_ZA |
| dc.subject | Newton algorithm | en_ZA |
| dc.subject | First-order optimality condition | en_ZA |
| dc.subject | Autonomous mobile robot | en_ZA |
| dc.subject | Robot programming | en_ZA |
| dc.subject | Newton-Raphson method | en_ZA |
| dc.subject | Motion planning | en_ZA |
| dc.subject | Mobile robots | en_ZA |
| dc.subject | Collision avoidance | en_ZA |
| dc.subject | Boundary value problems | en_ZA |
| dc.subject | Trajectory planning | en_ZA |
| dc.subject | Obstacle avoidance | en_ZA |
| dc.subject | Leapfrog algorithm | en_ZA |
| dc.subject | Pontryagin’s minimum principle | en_ZA |
| dc.subject | Modified Newton algorithm | en_ZA |
| dc.title | Modified Newton’s method in the leapfrog method for mobile robot path planning | en_ZA |
| dc.type | Postprint Article | en_ZA |
