{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:19:44Z","timestamp":1757312384543},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030440503"},{"type":"electronic","value":"9783030440510"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-44051-0_9","type":"book-chapter","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T20:02:40Z","timestamp":1588881760000},"page":"144-159","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An Approximation Algorithm for Risk-Averse Submodular Optimization"],"prefix":"10.1007","author":[{"given":"Lifeng","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Pratap","family":"Tokekar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"key":"9_CR1","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms, vol. 57. Oxford University Press, Oxford (1987)"},{"issue":"Feb","key":"9_CR2","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9(Feb), 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"9_CR3","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B.P., Matari\u0107, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 939\u2013954 (2004)","journal-title":"Int. J. Robot. Res."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 67\u201374. ACM (2008)","DOI":"10.1145\/1374376.1374389"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1177\/0278364903022001002","volume":"22","author":"JR Spletzer","year":"2003","unstructured":"Spletzer, J.R., Taylor, C.J.: Dynamic sensor planning and control for optimally tracking targets. Int. J. Robot. Res. 22(1), 7\u201320 (2003)","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TASE.2009.2037135","volume":"7","author":"O Tekdas","year":"2010","unstructured":"Tekdas, O., Isler, V.: Sensor placement for triangulation-based localization. IEEE Trans. Autom. Sci. Eng. 7(3), 681\u2013685 (2010)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Tokekar, P., Isler, V., Franchi, A.: Multi-target visual tracking with aerial robots. In: 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems, IROS 2014, pp. 3067\u20133072. IEEE (2014)","DOI":"10.1109\/IROS.2014.6942986"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1613\/jair.2674","volume":"34","author":"A Singh","year":"2009","unstructured":"Singh, A., Krause, A., Guestrin, C., Kaiser, W.J.: Efficient informative sensing using multiple robots. J. Artif. Intell. Res. 34, 707\u2013755 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions-II. In: Polyhedral Combinatorics, pp. 73\u201387. Springer (1978)","DOI":"10.1007\/BFb0121195"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Ding, H., Castan\u00f3n, D.: Multi-agent discrete search with limited visibility. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 108\u2013113. IEEE (2017)","DOI":"10.1109\/CDC.2017.8263651"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Williams, R.K., Gasparri, A., Ulivi, G.: Decentralized matroid optimization for topology constraints in multi-robot allocation problems. In: 2017 IEEE International Conference on Robotics and Automation (ICRA), pp. 293\u2013300. IEEE (2017)","DOI":"10.1109\/ICRA.2017.7989038"},{"issue":"10","key":"9_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MC.2002.1039518","volume":"35","author":"AD Wood","year":"2002","unstructured":"Wood, A.D., Stankovic, J.A.: Denial of service in sensor networks. Computer 35(10), 54\u201362 (2002)","journal-title":"Computer"},{"issue":"13\u201314","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1177\/0278364917709507","volume":"36","author":"P Dames","year":"2017","unstructured":"Dames, P., Tokekar, P., Kumar, V.: Detecting, localizing, and tracking an unknown number of moving targets using a team of mobile robots. Int. J. Robot. Res. 36(13\u201314), 1540\u20131553 (2017)","journal-title":"Int. J. Robot. Res."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"9_CR16","unstructured":"Prorok, A.: Supermodular optimization for redundant robot assignment under travel-time uncertainty. arXiv:1804.04986 (2018)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Pflug, G.Ch.: Some remarks on the value-at-risk and the conditional value-at-risk. In: Probabilistic Constrained Optimization, pp. 272\u2013281. Springer (2000)","DOI":"10.1007\/978-1-4757-3150-7_15"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000)","journal-title":"J. Risk"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Yang, F., Chakraborty, N.: Algorithm for optimal chance constrained linear assignment. In: 2017 IEEE International Conference on Robotics and Automation (ICRA), pp. 801\u2013808. IEEE (2017)","DOI":"10.1109\/ICRA.2017.7989099"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Yang, F., Chakraborty, N.: Algorithm for optimal chance constrained Knapsack problem with applications to multi-robot teaming. In: 2018 IEEE International Conference on Robotics and Automation (ICRA), pp. 1043\u20131049. IEEE (2018)","DOI":"10.1109\/ICRA.2018.8461040"},{"issue":"1","key":"9_CR21","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1), 77\u201391 (1952)","journal-title":"J. Finance"},{"key":"9_CR22","volume-title":"RiskMetrics Technical Document","author":"JP Morgan","year":"1996","unstructured":"Morgan, J.P.: RiskMetrics Technical Document. Morgan Guaranty Trust Company of New York, New York (1996)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Majumdar, A., Pavone, M.: How should a robot assess risk? Towards an axiomatic theory of risk in robotics. In: Robotics Research, pp. 75\u201384. Springer (2020)","DOI":"10.1007\/978-3-030-28619-4_10"},{"issue":"7","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1016\/S0378-4266(02)00271-6","volume":"26","author":"RT Rockafellar","year":"2002","unstructured":"Rockafellar, R.T., Uryasev, S.: Conditional value-at-risk for general loss distributions. J. Bank. Finance 26(7), 1443\u20131471 (2002)","journal-title":"J. Bank. Finance"},{"issue":"5","key":"9_CR25","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.orl.2015.08.001","volume":"43","author":"T Maehara","year":"2015","unstructured":"Maehara, T.: Risk averse submodular utility maximization. Oper. Res. Lett. 43(5), 526\u2013529 (2015)","journal-title":"Oper. Res. Lett."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Yoshida, Y.: Portfolio optimization for influence spread. In: Proceedings of the 26th International Conference on World Wide Web, pp. 977\u2013985. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052628"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Wilder, B.: Risk-sensitive submodular optimization. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.12121"},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J.-M., Heath, D.: Coherent measures of risk. Math. Finance 9(3), 203\u2013228 (1999)","journal-title":"Math. Finance"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Zhou, L., Tokekar, P.: An approximation algorithm for risk-averse submodular optimization. arXiv:1807.09358 (2018)","DOI":"10.1109\/MRS.2019.8901088"},{"issue":"1","key":"9_CR30","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MSPEC.2018.8241731","volume":"55","author":"E Ackerman","year":"2018","unstructured":"Ackerman, E., Strickland, E.: Medical delivery drones take flight in east africa. IEEE Spectr. 55(1), 34\u201335 (2018)","journal-title":"IEEE Spectr."},{"key":"9_CR31","unstructured":"Obermeyer, K.J. and Contributors: VisiLibity: A C++ library for visibility computations in planar polygonal environments (2008). http:\/\/www.VisiLibity.org"},{"issue":"3","key":"9_CR32","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9_CR33","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10514-017-9694-1","volume":"42","author":"S Jorgensen","year":"2018","unstructured":"Jorgensen, S., Chen, R.H., Milam, M.B., Pavone, M.: The team surviving orienteers problem: routing teams of robots in uncertain environments with survival constraints. Auton. Robots 42(4), 927\u2013952 (2018)","journal-title":"Auton. Robots"}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44051-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T20:30:06Z","timestamp":1696105806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44051-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030440503","9783030440510"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44051-0_9","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"type":"print","value":"2511-1256"},{"type":"electronic","value":"2511-1264"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAFR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Algorithmic Foundations of Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Merida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wafr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parasol.tamu.edu\/wafr\/wafr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}