{"type":"ScholarlyArticle","title":"Medusa: Towards Simulating a Multi-Agent Hide-and-Seek Game","authors":[{"name":"Akshat Tandon","slug":"akshat-tandon","given":"Akshat","family":"Tandon","affiliation":"Agents and Applied Robotics Group Kohli Center on Intelligent Systems International Institute of Information Technology , Hyderabad"},{"name":"Kamalakar Karlapalem","slug":"kamalakar-karlapalem","given":"Kamalakar","family":"Karlapalem","affiliation":"Agents and Applied Robotics Group Kohli Center on Intelligent Systems International Institute of Information Technology , Hyderabad"}],"abstract":"In the game of hide and seek, one or more agents (hiders) can hide behind objects to prevent other agents (seekers) from seeing them through their line of sight (visibility). These hider agents can be eventually found by seekers who explore the environment. The hide and seek model serves as an abstraction of many real world scenarios such as police agents trying to capture intruders hiding in a warehouse, security/patrolling agents on the lookout for any suspicious activity, spying drones trying to prevent themselves from being caught. Medusa allows modeling such scenarios by supporting the simulation, visualization and analysis of hider and seeker agent strategies under different environments.","doi":"10.24963/ijcai.2018/866","url":"https://ijcai.org/proceedings/2018/866","pdf":"https://ijcai.org/proceedings/2018/0866.pdf","markdown":"https://ijcai.org/proceedings/2018/866.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/866","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Demos","track":"Demos","number":866,"pages":{"first":5871,"last":5873},"keywords":["Agent-based and Multi-agent Systems: Multi-agent Planning","Knowledge Representation, Reasoning, and Logic: Geometric, Spatial, and Temporal Reasoning","Agent-based and Multi-agent Systems: Agent-Based Simulation and Emergence"],"videos":[],"references":[{"position":1,"raw":"[Alpern and Gal, 2006] Steve Alpern and Shmuel Gal. The theory of search games and rendezvous, volume 55. Springer Science & Business Media, 2006.","title":"The theory of search games and rendezvous","authors":"Alpern, Gal, Steve Alpern, Shmuel Gal","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baston and Kikuta, 2013] Vic Baston and Kensaku Kikuta. Search games on networks with travelling and search costs and with arbitrary searcher starting points. Networks, 62(1):72-79, 2013.","title":"Search games on networks with travelling and search costs and with arbitrary searcher starting points","authors":"Kikuta Baston, Vic Baston, Kensaku Kikuta","year":"2013","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bron and Kerbosch, 1973] Coen Bron and Joep Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973.","title":"Algorithm 457: finding all cliques of an undirected graph","authors":"Kerbosch Bron, Coen Bron, Joep Kerbosch","year":"1973","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chapman et al., 2014] Martin Chapman, Gareth Tyson, Pe- ter McBurney, Michael Luck, and Simon Parsons. Playing hide-and-seek: an abstract game for cyber security. In Pro- ceedings of the 1st International Workshop on Agents and CyberSecurity, page 3. ACM, 2014.","title":"Playing hide-and-seek: an abstract game for cyber security","authors":"Martin Chapman, Gareth Tyson, Peter Mcburney, Michael Luck, Simon Parsons","year":"2014","venue":"Proceedings of the 1st International Workshop on Agents and CyberSecurity","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dagan and Gal, 2008] Arnon Dagan and Shmuel Gal. Net- work search games, with arbitrary searcher starting point. Networks, 52(3):156-161, 2008.","title":"Arnon Dagan and Shmuel Gal. Network search games, with arbitrary searcher starting point","authors":"Gal Dagan","year":"2008","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Foreman, 1977] Joe G Foreman. Differential search games with mobile hider. SIAM Journal on Control and Opti- mization, 15(5):841-856, 1977.","title":"Differential search games with mobile hider","authors":"Joe G Foreman","year":"1977","venue":"SIAM Journal on Control and Optimization","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Lidbetter, 2013] Thomas Lidbetter. Hide-and-seek and other search games. PhD thesis, The London School of Economics and Political Science (LSE), 2013.","title":"Hide-and-seek and other search games","authors":"Thomas Lidbetter","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Tandon and Karlapalem, 2018] Akshat Tandon and Ka- malakar Karlapalem. Agent strategies for the hide-and- seek game. In Proc. of the 17th International Conference on Autonomous Agents and Multiagent Systems, 2018.","title":"Agent strategies for the hide-andseek game","authors":"Akshat Tandon, Kamalakar Karlapalem","year":"2018","venue":"Proc. of the 17th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Tisue and Wilensky, 2004] Seth Tisue and Uri Wilensky. Netlogo: A simple environment for modeling complex- ity. In International conference on complex systems, vol- ume 21, pages 16-21. Boston, MA, 2004.","title":"Netlogo: A simple environment for modeling complexity","authors":"Wilensky Tisue, Seth Tisue, Uri Wilensky","year":"2004","venue":"International conference on complex systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}