Perencanaan jalan digunakan untuk menentukan jalan yang akan dilalui oleh agen agar dapat mencapai tujuannya. Penggunaan perencanaan jalan tidak hanya diterapkan pada game melainkan juga diterapkan pada robot dan mesin lainnya yang memiliki kemampuan untuk bergerak. C-Theta* merupakan algoritma pere (original) (raw)

Path planning is used to determine the path the agent will travel through in order to achieve its objectives. The use of path planning is not only applicable to robots and other machines that have the ability to move. C-Theta * is a new path planning algorithm with speed and better planning results compared to its predecessor, the A * and Theta * algorithms. Of course, as the new algorithm C-Theta * has no further research on the prospects for future implementation, so researchers cannot know whether this algorithm can be implemented in the research. This study aims to provide a review of C-Theta * by using the comparative method, for comparing C-Theta * with a path planning algorithm and analyzing cases in other studies. To find out the possibility of implementing this algorithm in the test cases. The results of this study prove that C-Theta * has similarities with grid-based as A * and Theta *, making it possible for C-Theta * to work on A * algorithms and other grid-based algorit...