2008 International Conference on Machine Learning and Cybernetics 2008
DOI: 10.1109/icmlc.2008.4620946
|View full text |Cite
|
Sign up to set email alerts
|

An AI tool: Generating paths for racing game

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2009
2009
2018
2018

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 5 publications
0
6
0
1
Order By: Relevance
“…The implementation is not optimized and we are planning to utilize multi-core architecture (both CPU and GPU) in the future implementation. Tested paths in the database were generated via an automatic race path generation method proposed by Tan et al [22] [21]. We manually selected 2,000 race paths with good quality.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The implementation is not optimized and we are planning to utilize multi-core architecture (both CPU and GPU) in the future implementation. Tested paths in the database were generated via an automatic race path generation method proposed by Tan et al [22] [21]. We manually selected 2,000 race paths with good quality.…”
Section: Resultsmentioning
confidence: 99%
“…All racing-related path finding investigations and associated methods mentioned above were done with the objective of optimizing the finishing time, focused on a single racer. More closely related to our work, Tan et al proposed a framework to synthesize race paths that focused on several racers using the A* algorithm [8] executed sequentially [22] [21]. While their method is applicable to a racing game in terms of the calculation speed, their work was unable to guarantee that the final ranking of racers would satisfy any ranking constraint given by other modules.…”
Section: Related Workmentioning
confidence: 92%
See 1 more Smart Citation
“…Terdapat beberapa penelitian sebelumnya yang menjadi dasar dari penelitian ini. Salah satunya adalah penelitian yang dilakukan oleh (Tan, Chen, Tai, & Yen, 2008) mengenai kecerdasan buatan untuk membuat lintasan racing game. Pada penelitian tersebut pencarian lintasan racing game dilakukan dengan menggunakan algoritma A* untuk membuat lintasan, algoritma A* pada penelitian ini juga digunakan untuk menghindari obstacle yang ada pada lintasan.…”
Section: Penelitian Terkaitunclassified
“…All the aforementioned racing‐related path researches were performed with the objective of optimizing the finishing time of a single racer. In a work more closely related to ours, Tan et al proposed a framework to simulate race paths for several racers using sequential execution of the A* algorithm . Although their method is fast enough to be implemented in a racing game, their work lacks controllability of ranking in the path.…”
Section: Related Workmentioning
confidence: 99%