Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ugo Rosolia

dblp:186/8458 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0002-1682-0551ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 4 since 2021Systems, architecture and hardware · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 64% Motion planning and robot control · 18% Robot navigation and mapping · 18%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
partially observable reinforcement learning
0.712023
Mixed Observable RRT: Multi-Agent Mission-Planning in Partially Observable Environments · ICRA 2023
Robotics › Robot navigation and mapping
target search
0.712023
Mixed Observable RRT: Multi-Agent Mission-Planning in Partially Observable Environments · ICRA 2023
Machine learning › Reinforcement learning › markov decision process
constrained markov decision process
0.512021
Constrained Risk-Averse Markov Decision Processes · AAAI 2021
Machine learning › Reinforcement learning
markov decision process
0.512021
Constrained Risk-Averse Markov Decision Processes · AAAI 2021
Machine learning › Reinforcement learning › markov decision process
risk-averse markov decision process
0.512021
Constrained Risk-Averse Markov Decision Processes · AAAI 2021
Mathematical optimization › continuous optimization
convex optimization
0.512021
Constrained Risk-Averse Markov Decision Processes · AAAI 2021
Mathematical optimization › nonconvex optimization
difference of convex programming
0.512021
Constrained Risk-Averse Markov Decision Processes · AAAI 2021
Machine learning › Reinforcement learning
safe reinforcement learning
0.112021
Constrained Risk-Averse Markov Decision Processes · AAAI 2021

Methods — techniques the papers use, named apart from their topics

lagrangian relaxation · 1.0entropic value-at-risk · 1.0disciplined convex-concave programming · 1.0conditional value-at-risk · 1.0rapidly-exploring random tree · 0.7model predictive control · 0.7hidden markov model · 0.7dynamic programming · 0.7
YearPublicationVenuePosition
2025 Speed-Aware Network Design: A Parametric Optimization Approach
Ugo Rosolia, Marc Bataillou Almagro, George Iosifidis, Martin Groß 0001, Georgios S. Paschos
ATMOS1
2023 Mixed Observable RRT: Multi-Agent Mission-Planning in Partially Observable Environments
abstract
This paper considers centralized mission-planning for a heterogeneous multi-agent system with the aim of locating a hidden target. We propose a mixed observable setting, consisting of a fully observable state-space and a partially observable environment, using a hidden Markov model. First, we construct rapidly exploring random trees (RRTs) to introduce the mixed observable RRT for finding plausible mission plans giving way-points for each agent. Leveraging this construction, we present a path-selection strategy based on a dynamic programming approach, which accounts for the uncertainty from partial observations and minimizes the expected cost. Finally, we combine the high-level plan with model predictive control algorithms to evaluate the approach on an experimental setup consisting of a quadruped robot and a drone. It is shown that agents are able to make intelligent decisions to explore the area efficiently and locate the target through collaborative actions.
Kasper Johansson, Ugo Rosolia, Wyatt Ubellacker, Andrew Singletary, Aaron D. Ames
ICRA2
2021 Constrained Risk-Averse Markov Decision Processes
abstract
We consider the problem of designing policies for Markov decision processes (MDPs) with dynamic coherent risk objectives and constraints. We begin by formulating the problem in a Lagrangian framework. Under the assumption that the risk objectives and constraints can be represented by a Markov risk transition mapping, we propose an optimization-based method to synthesize Markovian policies that lower-bound the constrained risk-averse problem. We demonstrate that the formulated optimization problems are in the form of difference convex programs (DCPs) and can be solved by the disciplined convex-concave programming (DCCP) framework. We show that these results generalize linear programs for constrained MDPs with total discounted expected costs and constraints. Finally, we illustrate the effectiveness of the proposed method with numerical experiments on a rover navigation problem involving conditional-value-at-risk (CVaR) and entropic-value-at-risk (EVaR) coherent risk measures.
Mohamadreza Ahmadi, Ugo Rosolia, Michel D. Ingham, Richard M. Murray, Aaron D. Ames
AAAI2
2021 Learning to Control an Unstable System with One Minute of Data: Leveraging Gaussian Process Differentiation in Predictive Control
abstract
We present a straightforward and efficient way to control unstable robotic systems using an estimated dynamics model. Specifically, we show how to exploit the differentiability of Gaussian Processes to create a state-dependent linearized approximation of the true continuous dynamics that can be integrated with model predictive control. Our approach is compatible with most Gaussian process approaches for system identification, and can learn an accurate model using modest amounts of training data. We validate our approach by learning the dynamics of an unstable system such as a segway with a 7-D state space and 2-D input space (using only one minute of data), and we show that the resulting controller is robust to unmodelled dynamics and disturbances, while state-of-the-art control methods based on nominal models can fail under small perturbations. Code is open sourced at https://github.com/learning-and-control/core.
Ivan Dario Jimenez Rodriguez, Ugo Rosolia, Aaron D. Ames, Yisong Yue
IROS2
2021 ABC-LMPC: Safe Sample-Based Learning MPC for Stochastic Nonlinear Dynamical Systems with Adjustable Boundary Conditions
Brijen Thananjeyan, Ashwin Balakrishna, Ugo Rosolia, Joseph Gonzalez 0001, Aaron D. Ames, Kenneth Y. Goldberg
WAFR3