Integer linear programming formulations of the filter partitioning minimization problem

Abstract

Combinatorial filters, which take the form of labelled transition graphs, are a general representation for filtering and inference tasks in robotics. They are of particular interest in contexts where the objective is to minimize the computational resources needed to execute the filter. One specific problem is called the filter minimization (FM) problem, in which the goal is to find, for a given original filter, a state-minimal filter equivalent to the original filter. We consider a special case of FM, called the filter partitioning minimization (FPM) problem, in which the reduced filter must partition the state space of the original filter. This problem has been proven to be NP-hard. This paper considers the practical problem of solving FPM in spite of these hardness results. In contrast to the best known algorithm for this problem, a heuristic approach based on graph coloring proposed by O’Kane and Shell, we show how to convert an FPM instance to an instance of the well-known integer linear programming (ILP) problem. We present three distinct formulations of this reduction. Though ILP is itself a challenging problem, reducing FPM to ILP has the advantage that the ILP problem has been studied in great detail, and highly-optimized solvers are readily available. We describe experiments comparing this approach to the heuristic algorithm of O’Kane and Shell. The results show that the proposed ILP technique performs better in computing exact solutions as the filter sizes grow, and that the ILP approach obtains higher-quality feasible solutions, in contexts where time limitations prohibit the computation of exact solutions.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

References

  1. Alam T, Bobadilla L, Shell DA (2018) Space-efficient filters for mobile robot localization from discrete limit cycles. IEEE Robot Autom Lett 3(1):257–264

    Article  Google Scholar 

  2. Bobadilla L, Sanchez O, Czarnowski J, LaValle SM (2011) Minimalist multiple target tracking using directional sensor beams. In: Proceedings of the IEEE/RSJ international conference on intelligent robots and systems. IEEE, New York, pp 3101–3107

  3. Campêlo M, Corrêa R, Frota Y (2004) Cliques, holes and the vertex coloring polytope. Inf Process Lett 89(4):159–164

    MathSciNet  Article  Google Scholar 

  4. Campêlo M, Campos VA, Corrêa RC (2008) On the asymmetric representatives formulation for the vertex coloring problem. Discrete Appl Math 156(7):1097–1111

    MathSciNet  Article  Google Scholar 

  5. Chen Z et al (2003) Bayesian filtering: from Kalman filters to particle filters, and beyond. Statistics 182(1):1–69

    Article  Google Scholar 

  6. Choset H, Burdick J (1995) Sensor based planning. I. The generalized Voronoi graph. In: Proceedings of the IEEE international conference on robotics and automation, vol 2. IEEE, New York, pp 1649–1655

  7. Erdmann MA, Mason MT (1988) An exploration of sensorless manipulation. IEEE J Robot Autom 4(4):369–379

    Article  Google Scholar 

  8. Goldberg KY (1993) Orienting polygonal parts without sensors. Algorithmica 10(2):201–225

    MathSciNet  Article  Google Scholar 

  9. Ho Y, Lee R (1964) A Bayesian approach to problems in stochastic estimation and control. IEEE Trans Autom Control 9(4):333–339

    MathSciNet  Article  Google Scholar 

  10. Jabrayilov A, Mutzel P (2018) New integer linear programming models for the vertex coloring problem. In: Proceedings of the Latin American symposium on theoretical informatics. Springer, Berlin, pp 640–652

  11. Kalman RE (1960) A new approach to linear filtering and prediction problems. Trans ASME J Basic Eng 82:34–45

    MathSciNet  Google Scholar 

  12. Kristek SM, Shell DA (2012) In: Proceedings of the IEEE/RSJ international conference on intelligent robots and systems, pp 973–979

  13. Laguna G, Murrieta-Cid R, Becerra HM, Lopez-Padilla R, LaValle SM (2014) Exploration of an unknown environment with a differential drive disc robot. In: Proceedings of the IEEE international conference on robotics and automation, pp 2527–2533

  14. LaValle SM (2006) Planning algorithms. Cambridge University Press, Cambridge

    Google Scholar 

  15. LaValle SM, et al (2012) Sensing and filtering: a fresh perspective based on preimages and information spaces. Found. Trends\(^{\textregistered }\) Robot 1(4):253–372

  16. Lopez-Padilla R, Murrieta-Cid R, LaValle SM (2013) Optimal gap navigation for a disc robot. In: Proceedings of the international workshop on the algorithmic foundations of robotics. Springer, Berlin, pp 123–138

  17. Masreliez C, Martin R (1977) Robust Bayesian estimation for the linear model and robustifying the Kalman filter. IEEE Trans Autom Control 22(3):361–371

    MathSciNet  Article  Google Scholar 

  18. Méndez-Díaz I, Zabala P (2008) A cutting plane algorithm for graph coloring. Discrete Appl Math 156(2):159–179

    MathSciNet  Article  Google Scholar 

  19. O’Kane JM, Shell DA (2013) Automatic reduction of combinatorial filters. In: Proceedings of the IEEE international conference on robotics and automation. IEEE, New York, pp 4082–4089

  20. O’Kane JM, Shell DA (2017) Concise planning and filtering: hardness and algorithms. IEEE Trans Autom Sci Eng 14(4):1666–1681

    Article  Google Scholar 

  21. Rahmani H, O’Kane JM (2018) On the relationship between bisimulation and combinatorial filter reduction. In: Proceedings of the IEEE international conference on robotics and automation, pp 7314–7321

  22. Saberifar FZ, Mohades A, Razzazi M, O’Kane JM (2017) Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability. J Comput Syst Sci 85:74–92

    MathSciNet  Article  Google Scholar 

  23. Takahashi O, Schilling RJ (1989) Motion planning in a plane using generalized Voronoi diagrams. IEEE Trans Robot Autom 5(2):143–150

    Article  Google Scholar 

  24. Tovar B (2009) Minimalist models and methods for visibility-based tasks. University of Illinois at Urbana-Champaign

  25. Tovar B, Murrieta-Cid R, LaValle SM (2007) Distance-optimal navigation in an unknown environment without sensing distances. IEEE Trans Robot 23(3):506–518

    Article  Google Scholar 

  26. Tovar B, Cohen F, Bobadilla L, Czarnowski J, LaValle SM (2014) Combinatorial filters: sensor beams, obstacles, and possible paths. ACM Trans Sensor Netw 10(3):1–32

    Article  Google Scholar 

  27. van Hoeve WJ (2020) Graph coloring lower bounds from decision diagrams. In: Proceedings of the international conference on integer programming and combinatorial optimization. Springer, Berlin, pp 405–418

  28. Yu J, LaValle SM (2011) Story validation and approximate path inference with a sparse network of heterogeneous sensors. In: Proceedings of the IEEE international conference on robotics and automation, pp 4980–4985

  29. Yu J, LaValle SM (2012) Shadow information spaces: combinatorial filters for tracking targets. IEEE Trans Robot 28(2):440–456

    Article  Google Scholar 

  30. Zhang Y, Shell DA (2020) Cover combinatorial filters and their minimization problem. In: Proceedings of the international workshop on the algorithmic foundations of robotics

  31. Zhang Q, Rekleitis I, Dudek G (2015) Uncertainty reduction via heuristic search planning on hybrid metric/topological map. In: Proceedings of the 12th conference on computer and robot vision, pp 222–229

Download references

Acknowledgements

This material is based upon work supported by the National Science Foundation under Grant No. 1526862.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Hazhar Rahmani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This material is based upon work supported by the National Science Foundation under Grant No. 1526862.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Rahmani, H., O’Kane, J.M. Integer linear programming formulations of the filter partitioning minimization problem. J Comb Optim 40, 431–453 (2020). https://doi.org/10.1007/s10878-020-00609-w

Download citation

Keywords

  • Combinatorial filters
  • State space reduction
  • Integer linear programming
  • Automata minimization
  • Combinatorial optimization