Álvaro José Ortega Vargas, Jairo E. Serrano C., Leonardo Castellanos Acuña, J. Martinez-Santos
{"title":"基于波前算法的街机电子游戏非可玩角色路径规划","authors":"Álvaro José Ortega Vargas, Jairo E. Serrano C., Leonardo Castellanos Acuña, J. Martinez-Santos","doi":"10.1109/GMAX49668.2020.9256835","DOIUrl":null,"url":null,"abstract":"Search and planning is a common Artificial Intelligence task on videogames development. This exercise covers the design of Non-player character (NPC) behavior, content generation, and narrative's construction. This work focus on NPC behavior, specifically on path planning. This paper presents an implementation of an arcade videogame (Ms. Pacman type) with Unity, where the NPC's behavior (Ghosts) applies the Wavefront algorithm to find the shortest path to the Player Character (Mr. Pacman). This algorithm is an alternative to traditional algorithms the Djikstra algorithm and A-star used to solve this problem.","PeriodicalId":286421,"journal":{"name":"2020 IEEE Games, Multimedia, Animation and Multiple Realities Conference (GMAX)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Path Planning for Non-Playable Characters in Arcade Video Games using the Wavefront Algorithm\",\"authors\":\"Álvaro José Ortega Vargas, Jairo E. Serrano C., Leonardo Castellanos Acuña, J. Martinez-Santos\",\"doi\":\"10.1109/GMAX49668.2020.9256835\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Search and planning is a common Artificial Intelligence task on videogames development. This exercise covers the design of Non-player character (NPC) behavior, content generation, and narrative's construction. This work focus on NPC behavior, specifically on path planning. This paper presents an implementation of an arcade videogame (Ms. Pacman type) with Unity, where the NPC's behavior (Ghosts) applies the Wavefront algorithm to find the shortest path to the Player Character (Mr. Pacman). This algorithm is an alternative to traditional algorithms the Djikstra algorithm and A-star used to solve this problem.\",\"PeriodicalId\":286421,\"journal\":{\"name\":\"2020 IEEE Games, Multimedia, Animation and Multiple Realities Conference (GMAX)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Games, Multimedia, Animation and Multiple Realities Conference (GMAX)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GMAX49668.2020.9256835\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Games, Multimedia, Animation and Multiple Realities Conference (GMAX)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GMAX49668.2020.9256835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Path Planning for Non-Playable Characters in Arcade Video Games using the Wavefront Algorithm
Search and planning is a common Artificial Intelligence task on videogames development. This exercise covers the design of Non-player character (NPC) behavior, content generation, and narrative's construction. This work focus on NPC behavior, specifically on path planning. This paper presents an implementation of an arcade videogame (Ms. Pacman type) with Unity, where the NPC's behavior (Ghosts) applies the Wavefront algorithm to find the shortest path to the Player Character (Mr. Pacman). This algorithm is an alternative to traditional algorithms the Djikstra algorithm and A-star used to solve this problem.