SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Gupta Ankit 1988) srt2:(2018)"

Search: WFRF:(Gupta Ankit 1988) > (2018)

  • Result 1-2 of 2
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Gupta, Ankit, 1988, et al. (author)
  • Low-Complexity Explicit MPC Controller for Vehicle Lateral Motion Control
  • 2018
  • In: IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. ; 2018-November, s. 2839-2844
  • Conference paper (peer-reviewed)abstract
    • We consider the problem of controlling the vehicle lateral motion in highway scenarios while guaranteeing safety. We propose a solution consisting of a Low-Complexity Explicit Model Predictive Controller (LC-EMPC), where the lateral deviation from the desired path is hard constrained according to prescribed bounds. The robust satisfaction of such safety constraints can be achieved by imposing the terminal state to enter a Robust Invariant Set (RIS), which is known to result into a potentially high number of additional constraints, thus increasing the computational complexity of the controller. Our controller, instead, relies on recent results on the calculation of low-complexity RIS to significantly reduce the number of constraints in the MPC controller. Simulation results show that the designed controller is able to meet the desired objectives with highly reduced complexity.
  •  
2.
  • Klintberg, Emil, 1989, et al. (author)
  • A primal active-set minimal-representation algorithm for polytopes with application to invariant-set calculations
  • 2018
  • In: Proceedings of the IEEE Conference on Decision and Control. - 2576-2370 .- 0743-1546. ; 2018-December, s. 6862-6867
  • Conference paper (peer-reviewed)abstract
    • This paper provides a description of a practically efficient minimal-representation algorithm for polytopes. The algorithm is based on a primal active-set method that heavily exploits warm-starts and low-rank updates of matrix factorizations in order to reduce the required computational work. By using a primal active-set method, several nonredundant inequalities can be identified for each solved linear program. Implementation details are provided both for the minimalrepresentation algorithm and for the underlying active-set method.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-2 of 2
Type of publication
conference paper (2)
Type of content
peer-reviewed (2)
Author/Editor
Gupta, Ankit, 1988 (2)
Nilsson, Magnus (1)
Falcone, Paolo, 1977 (1)
Klintberg, Emil, 198 ... (1)
Mårdh, Lars Johannes ... (1)
University
Chalmers University of Technology (2)
Language
English (2)
Research subject (UKÄ/SCB)
Engineering and Technology (2)
Natural sciences (1)
Year
2018 (2)Undo refine

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view