Decentralized multi-agent entropy-driven exploration under sparsity constraints
暂无分享,去创建一个
[1] E.J. Candes,et al. An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.
[2] Pradeep Sen,et al. Compressive cooperative sensing and mapping in mobile networks , 2009, ACC.
[3] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[4] F. Pukelsheim. Optimal Design of Experiments , 1993 .
[5] Yasamin Mostofi,et al. Compressive cooperative sensing and mapping in mobile networks , 2009, 2009 American Control Conference.
[6] Urbashi Mitra,et al. Mission design for compressive sensing with mobile robots , 2011, 2011 IEEE International Conference on Robotics and Automation.
[7] Gonzalo Mateos,et al. Distributed Sparse Linear Regression , 2010, IEEE Transactions on Signal Processing.
[8] D. Lorenz,et al. A semismooth Newton method for Tikhonov functionals with sparsity constraints , 2007, 0709.3186.
[9] Dmitriy Shutin,et al. A semismooth Newton method for adaptive distributed sparse linear regression , 2015, 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).
[10] H. Zou,et al. Regularization and variable selection via the elastic net , 2005 .
[11] Frank P. Ferrie,et al. Autonomous exploration: driven by uncertainty , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.
[12] Christoph Manss,et al. Exploration under sparsity constraints , 2015, 2015 European Conference on Mobile Robots (ECMR).
[13] Nicholas Roy,et al. Global A-Optimal Robot Exploration in SLAM , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.