21 citations · 25 across the 7 of their papers we have counts for
7 papers
Robust Optimal Contribution Selection
Josh Fogg, Jaime Ortiz, Ivan Pocrnić +2
Optimal contribution selection (OCS) is a selective breeding method that manages the conversion of genetic variation into genetic gain to facilitate short-term competitiveness and…
On the Synthesis of Reactive Collision-Free Whole-Body Robot Motions: A Complementarity-based Approach
Haowen Yao, Riddhiman Laha, Anirban Sinha +4
This paper is about generating motion plans for high degree-of-freedom systems that account for collisions along the entire body. A particular class of mathematical programs with c…
Online Trajectory Optimization for Persistent Monitoring Problems in Partitioned Environments
Jonas Hall, Christos G. Cassandras, Sean B. Andersson
We consider the problem of using an autonomous agent to persistently monitor a collection of dynamic targets distributed in an environment. We generalize existing work by allowing…
A Bilevel Optimization Scheme for Persistent Monitoring
Jonas Hall, Logan E. Beaver, Christos G. Cassandras +1
In this paper we study an infinite-horizon persistent monitoring problem in a two-dimensional mission space containing a finite number of statically placed targets, at each of whic…
LCQPow -- A Solver for Linear Complementarity Quadratic Programs
Jonas Hall, Armin Nurkanovic, Florian Messerer +1
In this paper we introduce an open-source software package written in C++ for efficiently finding solutions to quadratic programming problems with linear complementarity constraint…
Optimal Persistent Monitoring of Mobile Targets in One Dimension
Jonas Hall, Sean B. Andersson, Christos G. Cassandras
This work shows the existence of optimal control laws for persistent monitoring of mobile targets in a one-dimensional mission space and derives explicit solutions. The underlying…
A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems with Linear Complementarity Constraints
Jonas Hall, Armin Nurkanovic, Florian Messerer +1
Mathematical programs with complementarity constraints are notoriously difficult to solve due to their nonconvexity and lack of constraint qualifications in every feasible point. T…