Imperial College London

DrBenoitChachuat

Faculty of EngineeringDepartment of Chemical Engineering

Reader in Process Systems Engineering
 
 
 
//

Contact

 

b.chachuat Website

 
 
//

Location

 

354ARoderic Hill BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Feng:2017:10.1109/CDC.2017.8263749,
author = {Feng, X and Villanueva, ME and Chachuat, B and Houska, B},
doi = {10.1109/CDC.2017.8263749},
publisher = {IEEE},
title = {Branch-and-Lift algorithm for obstacle avoidance control},
url = {http://dx.doi.org/10.1109/CDC.2017.8263749},
year = {2017}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - Obstacle avoidance problems are a class of non-convex optimal control problems for which derivative-based optimization algorithms often fail to locate global minima. The goal of this paper is to provide a tutorial on how to apply Branch & Lift algorithms, a novel class of global optimal control methods, for solving such obstacle avoidance problems to global optimality. The focus of the technical developments is on how Branch & Lift methods can exploit the particular structure of Dubin models, which can be used to model a variety of practical obstacle avoidance problems. The global convergence properties of Branch & Lift in the context of obstacle avoidance is discussed from a theoretical as well as a practical perspective by applying it to a tutorial example.
AU - Feng,X
AU - Villanueva,ME
AU - Chachuat,B
AU - Houska,B
DO - 10.1109/CDC.2017.8263749
PB - IEEE
PY - 2017///
SN - 0743-1546
TI - Branch-and-Lift algorithm for obstacle avoidance control
UR - http://dx.doi.org/10.1109/CDC.2017.8263749
UR - http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000424696900116&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
UR - http://hdl.handle.net/10044/1/71330
ER -