Explore live open-source projects and AI models.

Honours Project. Pathfinding with adaptive mesh refinement. The implementation of the Field D* algorithm in 2D and 2.5D triangle meshes with adaptive refinements. We’re aiming to perform local mesh refinements to produce a fine triangle mesh in areas traversed by a calculated path and iteratively... Read more

Objective of this project was to select minimum cost path for sending packets from router A to router B such that all routers are traversed, hence this problem is different to Travelling Salesmen Problem (TSP), where Intermediate nodes can be left off. Initial location for all routers was randoml... Read more

A ES6 Generator that traverses the child nodes within the given `Node`

BDP 05: CLUSTERING OF LARGE UNLABELED DATASETS OVERVIEW Real world data is frequently unlabeled and can seem completely random. In these sort of situations, unsupervised learning techniques are a great way to find underlying patterns. This project looks at one such algorithm, KMeans clustering, ... Read more