Fast Trajectory Replanning

A implementation of repeated A star algorithm.
Explore the docs »

View Demo · Report Bug · Request Feature

Table of Contents

1. About The Project
   • Built with
2. License
3. Contact

About The Project

This is a course project of Rutgers CS440 Intro to Artificial Intelligence.

Built with

• Language:

• Python Packages:

License

Distributed under the MIT License.

See LICENSE for more information.

Contact

Feiyu Zheng - feiyuzheng98@gmail.com

Project Link: https://github.com/ChaserZ98/Fast-Trajectory-Replanning

(back to top)

Part 1

(a) There are three available actions at E2, to the west, to the north and to the east. The destinations of three actions are respectively E1, D2 and E3.

f(E1)=g(E1)+h(E1)=1+4=5
f(D2)=g(D2)+h(D2)=1+4=5
f(E3)=g(E3)+h(E3)=1+2=3

Since E3 has the least f value, then the first move is to the E3, which is to the east.