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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of advanced robotic systems Ročník 15; číslo 1
Hlavní autoři:	Cai, Lei, Yang, Juanjuan, Zhao, Li, Wu, Lan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London, England SAGE Publications 01.01.2018 Sage Publications Ltd SAGE Publishing
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!