Shortest Path algorithm(A*) and Collision detection using Unity(Complex System- Part Two)

Опубликовано: 14 Март 2025
на канале: Codynn

289

This is project is done by Mr. Kalyan Khatri currently studying at Herald College Kathmandu.This is a part of the coursework of complex system. This second agent builds upon a previously developed autonomous automated agent that represents a delivery or collection agent, such as a robot. The agent starts at a home location and delivers or collects an item (e.g. parcel) from a goal location, before returning home. The agent must be able to act and react to obstacles and other instances of itself in the environment, and be able to carry at least 10 items. The speed of the agent should decrease by 10% for each additional item it is carrying, with a maximum decrease of 90%. The agent must include a visual representation of the items it is carrying and be able to navigate through an environment that contains many other agents, using a waypoint graph and pathfinding technique. The agent should monitor its environment for other agents and collaborate with them by adjusting its speed and communicating with them to avoid blocking each other. The agent should also consider the agents' speed and immediate direction/destination when deciding which agent should move first. Performance information should also be included in the agent's interactions with other agents.
Complex System Unity Projects Shortest Path algorithm(A*) and Collision detection(Herald College)