An efficient optimization algorithm for quadratic programming problem and its applications to mobile robot path planning

The quadratic programming problem has broad applications in mobile robot path planning. This article presents an efficient optimization algorithm for globally solving the quadratic programming problem. By utilizing the convexity of univariate quadratic functions, we construct the linear relaxation p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of advanced robotic systems Jg. 15; H. 1
Hauptverfasser:	Cai, Lei, Yang, Juanjuan, Zhao, Li, Wu, Lan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London, England SAGE Publications 01.01.2018 Sage Publications Ltd SAGE Publishing
Schlagworte:	Algorithms Computing time Convexity Optimization Optimization algorithms Path planning Pruning Quadratic equations Quadratic programming Robots linear relaxation programming path planning Quadratic programming problem global optimization pruning technique branch-and-bound optimization algorithm
ISSN:	1729-8806, 1729-8814
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!