Finding an optimal path on the terrain
Finding an optimal path on the terrain by using the forward dynamic programming algorithm.
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
The terrain is generated using MATLAB code from the following link:
The car must travel as close as possible to the target coordinate. The travel time should be as short as possible. The car can only move one step at a time in eight directions: left, right, up, down, up-left, down-left, up-right, and down-right.
The cost function is defined as the difference in altitude and it is always positive numbers. During the travel, the car must avoid climb trajectories. However, descent trajectories does not benefit the car either. Thus, descent trajectories are not more preferable than flat trajectories.
A more generalized version of this topic has been made available at:
인용 양식
Auralius Manurung (2026). Finding an optimal path on the terrain (https://kr.mathworks.com/matlabcentral/fileexchange/39034-finding-an-optimal-path-on-the-terrain), MATLAB Central File Exchange. 검색 날짜: .
