PUBLICATIONS

Books | Patents | 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | before 2007

2020

Wei Xiao, Calin Belta, Christos G. Cassandras, Feasibility-Guided Learning for Constrained Optimal Control Problems, 59th IEEE Conference on Decision and Control (CDC), 2020 (pdf)

bibtex

@INPROCEEDINGS{9303857,
author={Xiao, Wei and Belta, Calin A. and Cassandras, Christos G.},
booktitle={2020 59th IEEE Conference on Decision and Control (CDC)},
title={Feasibility-Guided Learning for Constrained Optimal Control Problems},
year={2020},
volume={},
number={},
pages={1896-1901},
doi={10.1109/CDC42340.2020.9303857}}

Max Cohen and Calin Belta, Approximate Optimal Control for Safety-Critical Systems with Control Barrier Functions, 59th IEEE Conference on Decision and Control (CDC), 2020 (pdf)

Cristian Vasile, Xiao Li, Calin Belta, Reactive sampling-based path planning with temporal logic specifications, The International Journal of Robotics Research, vol. 39, issue: 8, page(s): 1002-1028, 2020 (pdf)

bibtex

@article{vasile2020reactive,
title={Reactive sampling-based path planning with temporal logic specifications},
author={Vasile, Cristian Ioan and Li, Xiao and Belta, Calin},
journal={The International Journal of Robotics Research},
volume={39},
number={8},
pages={1002–1028},
year={2020},
publisher={SAGE Publications Sage UK: London, England}}

Zachary Serlin, Guang Yang, Brandon Sookraj, Calin Belta, Roberto Tron, Distributed and consistent multi-image feature matching via QuickMatch, International Journal of Robotic Research, no. 10-11, pp. 1222-1238, vol. 39, 2020 (pdf)

bibtex

@article{doi:10.1177/0278364920917465,
author = {Zachary Serlin and Guang Yang and Brandon Sookraj and Calin Belta and Roberto Tron},
doi = {10.1177/0278364920917465},
eprint = {https://doi.org/10.1177/0278364920917465},
journal = {The International Journal of Robotics Research},
number = {10-11},
pages = {1222-1238},
title = {Distributed and consistent multi-image feature matching via QuickMatch},
url = {https://doi.org/10.1177/0278364920917465},
volume = {39},
year = {2020},
bdsk-url-1 = {https://doi.org/10.1177/0278364920917465}}

Penedo, Francisco and Vasile, Cristian-Ioan and Belta, Calin, Language-Guided Sampling-based Planning using Temporal Relaxation, Algorithmic Foundations of Robotics XII: Proceedings of the Twelfth Workshop on the Algorithmic Foundations of Robotics, Springer International Publishing, Cham, pp. 128–143, 2020 (pdf)

bibtex

@inbook{Penedo2020,

abstract = {In this paper, we focus on robot motion planning from timed temporal logic specifications. We propose a sampling-based algorithm and an associated language-guided biasing scheme. We leverage the notion of temporal relaxation of time-window temporal logic formulae (TWTL) to reformulate the temporal logic synthesis problem into an optimization problem. Our algorithm exhibits an exploration-exploitation structure, but retains probabilistic completeness. Moreover, if the problem does not have a solution due to time constraints, the algorithm returns a candidate path that satisfies a minimally relaxed version of the specification. The path may inform operators about timing problems with the specification or the system. We provide simulations to highlight the performance of the proposed algorithm.},

address = {Cham},

author = {Penedo, Francisco and Vasile, Cristian-Ioan and Belta, Calin},

booktitle = {Algorithmic Foundations of Robotics XII: Proceedings of the Twelfth Workshop on the Algorithmic Foundations of Robotics},

doi = {10.1007/978-3-030-43089-4_9},

editor = {Goldberg, Ken and Abbeel, Pieter and Bekris, Kostas and Miller, Lauren},

isbn = {978-3-030-43089-4},

pages = {128–143},

publisher = {Springer International Publishing},

title = {Language-Guided Sampling-based Planning using Temporal Relaxation},

url = {https://doi.org/10.1007/978-3-030-43089-4_9},

year = {2020},

bdsk-url-1 = {https://doi.org/10.1007/978-3-030-43089-4_9}}

Wei Xiao, Christos Cassandras, Calin Belta, Decentralized Optimal Control in Multi-lane Merging for Connected and Automated Vehicles, 23rd IEEE Intelligent Transportation Systems Conference (ITSC), 2020 (pdf)

bibtex

@INPROCEEDINGS{9294469,
author={Xiao, Wei and Cassandras, Christos G. and Belta, Calin},
booktitle={2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)},
title={Decentralized Optimal Control in Multi-lane Merging for Connected and Automated Vehicles},
year={2020},
volume={},
number={},
pages={1-6},
doi={10.1109/ITSC45102.2020.9294469}}

Chuangchuang Sun, Xiao Li, Calin Belta, Automata Guided Semi-Decentralized Multi-Agent Reinforcement Learning, American Control Conference (ACC), Denver, CO, USA, 2020 (pdf)

bibtex

@INPROCEEDINGS{9147704,
author={Sun, Chuangchuang and Li, Xiao and Belta, Calin},
booktitle={2020 American Control Conference (ACC)},
title={Automata Guided Semi-Decentralized Multi-Agent Reinforcement Learning},
year={2020},
volume={},
number={},
pages={3900-3905},
doi={10.23919/ACC45564.2020.9147704}}

Guang Yang, Roberto Tron, Calin Belta, Continuous-time Signal Temporal Logic Planning with Control Barrier Functions, American Control Conference (ACC), Denver, CO, USA, 2020 (pdf)

bibtex

@INPROCEEDINGS{9147387,
author={Yang, Guang and Belta, Calin and Tron, Roberto},
booktitle={2020 American Control Conference (ACC)},
title={Continuous-time Signal Temporal Logic Planning with Control Barrier Functions},
year={2020},
volume={},
number={},
pages={4612-4618},
doi={10.23919/ACC45564.2020.9147387}}

Kasra Ghasemi, Sadra Sadraddini and Calin Belta, Compositional Synthesis via a Convex Parameterization of Assume-Guarantee Contracts, Hybrid Systems: Computation and Control (HSCC), Sydney, Australia, 2020 (pdf)

bibtex

@inproceedings{10.1145/3365365.3382212,

abstract = {We develop an assume-guarantee framework for control of large scale linear (time-varying) systems from finite-time reach and avoid or infinite-time invariance specifications. The contracts describe the admissible set of states and controls for individual subsystems. A set of contracts compose correctly if mutual assumptions and guarantees match in a way that we formalize. We propose a rich parameterization of contracts such that the set of parameters that compose correctly is convex. Moreover, we design a potential function of parameters that describes the distance of contracts from a correct composition. Thus, the verification and synthesis for the aggregate system are broken to solving small convex programs for individual subsystems, where correctness is ultimately achieved in a compositional way. Illustrative examples demonstrate the scalability of our method.},

address = {New York, NY, USA},

articleno = {16},

author = {Ghasemi, Kasra and Sadraddini, Sadra and Belta, Calin},

booktitle = {Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control},

doi = {10.1145/3365365.3382212},

isbn = {9781450370189},

keywords = {compositional synthesis, assume-guarantee contracts, viable sets, zonotopes, linear systems},

location = {Sydney, New South Wales, Australia},

numpages = {10},

publisher = {Association for Computing Machinery},

series = {HSCC ’20},

title = {Compositional Synthesis via a Convex Parameterization of Assume-Guarantee Contracts},

url = {https://doi.org/10.1145/3365365.3382212},

year = {2020},

bdsk-url-1 = {https://doi.org/10.1145/3365365.3382212}}

Books | Patents | 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | before 2007