Solving Hybrid Decision-Control Problems Through Conflict-Directed Branch & Bound

@inproceedings{Krishnan2004SolvingHD,
  title={Solving Hybrid Decision-Control Problems Through Conflict-Directed Branch & Bound},
  author={Raj Krishnan},
  year={2004}
}
there exists a large class of problems that incorporate both logical decision and algebraic constraints. For example, in cooperative path planning (CPP) problem, obstacle avoidance can be achieved by selecting a direction in which to avoid every obstacle, which in turn imposes an inequality constraint. Traditionally, these hybrid decision-control problems (HDCPs) are encoded in a binary integer program (BIP). These BIPs are solved using Branch and Bound (B&B) techniques. Two problems arise with… CONTINUE READING
6 Extracted Citations
14 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

Reasoning about Preference Models

  • Wellman M.P
  • Technical Report MIT/LCS/TR-340, Laboratory for…
  • 1985
Highly Influential
3 Excerpts

Reducing Linear Inequalities to Propositional Formulas

  • Strichman, 0., S. A. Seshia, R. E. Bryant
  • Proceedings qf CA V '02, vol. 2404 of LNCS, 2002.
  • 2002
3 Excerpts

Advances in Linear and Integer Programming

  • J. E. Beasley
  • 1996

Similar Papers

Loading similar papers…