Abstract
Automatic control systems, electronic circuit design, image registration, SLAM and several other engineering problems all require nonconvex optimization. Many approaches have been developed to carry out such nonconvex optimization, but they suffer drawbacks including large computation time, require tuning of multiple unintuitive parameters and are unable to find multiple local/global minima. In this work we introduce multiple start branch and prune filtering algorithm (MSBP), a Kalman filtering-based method for solving nonconvex optimization problems. MSBP starts off with a number of initial state estimates, which are branched and pruned based on the state uncertainty and innovation respectively. We show that compared to popular methods used for solving nonconvex optimization problems, MSBP has fewer parameters to tune, making it easier to use. Through a case study of point set registration, we demonstrate the efficiency of MSBP in estimating multiple global minima, and show that MSBP is robust to initial estimation error in the presence of noise and incomplete data. The results are compared to other popular methods for nonconvex optimization using standard datasets. Overall MSBP offers a better success rate at finding the optimal solution with less computation time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Besl, P.: A Method for Registration of 3-D Shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 14(2), 239–256 (1992)
Brooks, S.P., Morgan, B.J.: Optimization using simulated annealing. The Statistician pp. 241–257 (1995)
Friesen, A.L., Domingos, P.: Recursive decomposition for nonconvex optimization. In: Proceedings of IJCAI (2015)
Gupta, N., Hauser, R.: Kalman filtering with equality and inequality state constraints. arXiv preprint arXiv:0709.2791 (2007)
Holland, J.H.: Outline for a logical theory of adaptive systems. Journal of the ACM 9(3), 297–314 (1962)
Horn, B.: Closed-form solution of absolute orientation using unit quaternions. Journal of the Optical Society of America A 4, 629–642 (1987)
Ingber, L.: Simulated annealing: Practice versus theory. Mathematical and computer modelling 18(11), 29–57 (1993)
Izadi, S., Kim, D., Hilliges, O., Molyneaux, D., Newcombe, R., Kohli, P., Shotton, J., Hodges, S., Freeman, D., Davison, A., et al.: KinectFusion: real-time 3D reconstruction and interaction using a moving depth camera. In: Proceedings of the 24th annual ACM symposium on User interface software and technology. pp. 559–568 (2011)
Jazwinski, A.H.: Stochastic processes and filtering theory. Courier Corp. (2007)
Kalman, R.E.: A new approach to linear filtering and prediction problems. Journal of Basic Engineering 82(1), 35–45 (1960)
Kang, Z., Chen, J., Wang, B.: Global Registration of Subway Tunnel Point Clouds Using an Augmented Extended Kalman Filter and Central-Axis Constraint. PloS one 10(5) (2015)
Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operations research 14(4), 699–719 (1966)
Lucas, B.D., Kanade, T., et al.: An iterative image registration technique with an application to stereo vision. In: International Joint Conference on Artificial Intelligence. vol. 81, pp. 674–679 (1981)
Luck, J., Little, C., Hoff, W.: Registration of range data using a hybrid simulated annealing and iterative closest point algorithm. In: Proceedings of IEEE International Conference on Robotics and Automation. pp. 3739–3744. IEEE (2000)
Ma, B., Ellis, R.E.: Surface-based registration with a particle filter. In: International Conference on Medical Image Computing and Computer-Assisted Intervention. pp. 566–573. Springer (2004)
Moghari, M.H., Abolmaesumi, P.: Point-based rigid-body registration using an unscented Kalman filter. IEEE Transactions on Medical Imaging 26(12), 1708–1728 (2007)
Neumaier, A., Shcherbina, O., Huyer, W., Vinkó, T.: A comparison of complete global optimization solvers. Mathematical programming 103(2), 335–356 (2005)
Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm intelligence 1(1), 33–57 (2007)
Ram, D.J., Sreenivas, T., Subramaniam, K.G.: Parallel simulated annealing algorithms. Journal of parallel and distributed computing 37(2), 207–212 (1996)
Reid, D.B.: An algorithm for tracking multiple targets. IEEE Transactions on Automatic Control 24(6), 843–854 (1979)
Rusinkiewicz, S., Levoy, M.: Efficient variants of the ICP algorithm. In: Proceedings. Third International Conference on 3-D Digital Imaging and Modeling. pp. 145–152 (2001)
Schoen, F.: Stochastic techniques for global optimization: A survey of recent advances. Journal of Global Optimization 1(3), 207–228 (1991)
Schoen, F.: A wide class of test functions for global optimization. Journal of Global Optimization 3(2), 133–137 (1993)
Schön, T., Gustafsson, F., Hansson, A.: A note on state estimation as a convex optimization problem. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing. vol. 6, pp. VI–61. IEEE (2003)
Seixas, F.L., Ochi, L.S., Conci, A., Saade, D.M.: Image registration using genetic algorithms. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation. pp. 1145–1146. ACM (2008)
Simon, D., Chia, T.L.: Kalman filtering with state equality constraints. IEEE transactions on Aerospace and Electronic Systems 38(1), 128–136 (2002)
Srivatsan, R.A., Rosen, G.T., Naina, F.M., Choset, H.: Estimating SE(3) elements using a dual-quaternion based linear Kalman filter. in the proceedings of Robotics Science and Systems (2016)
Toscano, R., Lyonnet, P.: Heuristic Kalman algorithm for solving optimization problems. IEEE Transactions on Systems, Man, and Cybernetics 39(5), 1231–1244 (2009)
Toscano, R., Lyonnet, P.: A Kalman Optimization Approach for Solving Some Industrial Electronics Problems. IEEE Transactions on Industrial Electronics 11(59), 4456–4464 (2012)
Turk, G., Levoy, M.: The Stanford 3D Scanning Repository. Stanford University Computer Graphics Laboratory http://graphics.stanford.edu/data/3Dscanrep
Yang, J., Li, H., Jia, Y.: Go-ICP: Solving 3D Registration Efficiently and Globally Optimally. In: 2013 IEEE International Conference on Computer Vision (ICCV). pp. 1457–1464 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Srivatsan, R.A., Choset, H. (2020). Multiple Start Branch and Prune Filtering Algorithm for Nonconvex Optimization. In: Goldberg, K., Abbeel, P., Bekris, K., Miller, L. (eds) Algorithmic Foundations of Robotics XII. Springer Proceedings in Advanced Robotics, vol 13. Springer, Cham. https://doi.org/10.1007/978-3-030-43089-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-43089-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43088-7
Online ISBN: 978-3-030-43089-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)