{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T05:45:46Z","timestamp":1694497546360},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2010,10]]},"abstract":"<jats:p> We propose a set of path planning tools including path generator, cost map generator, and path editor for racing games. The user can define the race by providing a racetrack as a 3D model and weights of the devised turn and heuristic functions in our system. Then, the proposed cost map generator automatically generates necessary information of the racetrack including cost map and distance to finish of any position on the race track. Different from the traditional A* problem, in our research the obstacles are dynamic and there are multiple sources and destinations. Our approach generates the path of each racer on the basis of time slots to which the path finding method applies on the fly. To further guarantee the quality of the path, we implement path smoothing using a Gaussian filter and provide an off-line path editor that allows users to edit the path in time-space domain intuitively, flexibly, and effectively. Our tools have been verified in a horse racing game to generate natural racer behaviors, demonstrating realistic and exciting racing. <\/jats:p>","DOI":"10.1142\/s0218213010000364","type":"journal-article","created":{"date-parts":[[2010,10,15]],"date-time":"2010-10-15T10:00:37Z","timestamp":1287136837000},"page":"679-702","source":"Crossref","is-referenced-by-count":3,"title":["PATH PLANNING FOR RACING GAMES"],"prefix":"10.1142","volume":"19","author":[{"given":"CHARLIE IRAWAN","family":"TAN","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Da Hsueh Rd., Shoufeng, Hualien 97401, Taiwan, R.O.C."}]},{"given":"CHANG-MIN","family":"CHEN","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Da Hsueh Rd., Shoufeng, Hualien 97401, Taiwan, R.O.C."}]},{"given":"WEN-KAI","family":"TAI","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Da Hsueh Rd., Shoufeng, Hualien 97401, Taiwan, R.O.C."}]},{"given":"CHIN-CHEN","family":"CHANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National United University, 1, Lien-Da, Kung-ching Li, Miaoli 360, Taiwan, R.O.C."}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"rf2","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"Hutchinson Seth","year":"2005"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"rf5","first-page":"556","volume":"12","author":"Svestka P.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1994.9990143"},{"key":"rf7","first-page":"4282","volume":"51","author":"Helbing D.","journal-title":"Physical Review"},{"key":"rf15","first-page":"100","volume":"4","author":"Raphael Bertram","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"rf16","volume-title":"Basic A* Pathfinding Made Simple","author":"Matthews James","year":"2002"},{"key":"rf17","volume-title":"How to Achieve Lightning-Fast A*","author":"Higgins Dan","year":"2002"},{"key":"rf18","volume-title":"Generic A* Pathfinding","author":"Higgins Dan","year":"2002"},{"key":"rf19","volume-title":"Representing a Racetrack for the AI","author":"Biasillo Gari","year":"2002"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2003.1210860"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213010000364","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:25:44Z","timestamp":1565144744000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213010000364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":12,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2010,10]]}},"alternative-id":["10.1142\/S0218213010000364"],"URL":"https:\/\/doi.org\/10.1142\/s0218213010000364","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}