Shortest path algorithms in a heatmap.
显示 更早的评论
I have created a heatmap that shows a map or structure of my apartment. I have created it by using 24X24 grids for that i have created a dataset myself for simulations in which each grid value represents the probability of human presence in that node. For visualization consider a node represents a square of 0.5 square meters. Now i have a situation in which i will have a starting node and a destination node. I want an algorithm that can create or tell me shortest path for the 2 nodes. That algorithm has to consider the facts that some nodes will have 0 probablilty for the areas of the heatmap representing furnitures. Any suggestions regd the algorithm with some details too.
4 个评论
agrim agarwal
2020-4-3
Matt J
2020-4-4
So distance can be represented or measured by number of nodes we have to travel.
In that case, the straight line between the two nodes is the shortest path. If the problem is to be non-trivial, there need to be some constraints on the selection of the path. You haven't mentioned wthat those constraints are.
agrim agarwal
2020-4-12
those constrains are the nodes representing furnitures and other inaacessible parts of the taraget apartment.
采纳的回答
Image Analyst
2020-4-3
1 个投票
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
