Algorithm for on road key points detection The Next CEO of Stack OverflowWhat is the best algorithm for an overridden System.Object.GetHashCode?What algorithms compute directions from point A to point B on a map?Easy interview question got harder: given numbers 1..100, find the missing number(s)Graph auto-layout algorithmUkkonen's suffix tree algorithm in plain EnglishImage Processing: Algorithm Improvement for 'Coca-Cola Can' RecognitionHow to find time complexity of an algorithmGiven two point sets A and B, how do you find the point in A farthest away from B?What is the optimal algorithm for the game 2048?Considering Start point and end point on edge, not Node of graph in Path finding algorithm for Road Network Graph
Proper way to express "He disappeared them"
Why the difference in type-inference over the as-pattern in two similar function definitions?
Why did CATV standarize in 75 ohms and everyone else in 50?
Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis
Flying from Cape Town to England and return to another province
Is it my responsibility to learn a new technology in my own time my employer wants to implement?
Is micro rebar a better way to reinforce concrete than rebar?
Easy to read palindrome checker
Is it convenient to ask the journal's editor for two additional days to complete a review?
Chain wire methods together in Lightning Web Components
How to avoid supervisors with prejudiced views?
A Man With a Stainless Steel Endoskeleton (like The Terminator) Fighting Cloaked Aliens Only He Can See
Why do airplanes bank sharply to the right after air-to-air refueling?
Math-accent symbol over parentheses enclosing accented symbol (amsmath)
Can you be charged for obstruction for refusing to answer questions?
How to check if all elements of 1 list are in the *same quantity* and in any order, in the list2?
Axiom Schema vs Axiom
Should I tutor a student who I know has cheated on their homework?
Is wanting to ask what to write an indication that you need to change your story?
How to delete every two lines after 3rd lines in a file contains very large number of lines?
What does "Its cash flow is deeply negative" mean?
Legal workarounds for testamentary trust perceived as unfair
Is it ever safe to open a suspicious HTML file (e.g. email attachment)?
What happened in Rome, when the western empire "fell"?
Algorithm for on road key points detection
The Next CEO of Stack OverflowWhat is the best algorithm for an overridden System.Object.GetHashCode?What algorithms compute directions from point A to point B on a map?Easy interview question got harder: given numbers 1..100, find the missing number(s)Graph auto-layout algorithmUkkonen's suffix tree algorithm in plain EnglishImage Processing: Algorithm Improvement for 'Coca-Cola Can' RecognitionHow to find time complexity of an algorithmGiven two point sets A and B, how do you find the point in A farthest away from B?What is the optimal algorithm for the game 2048?Considering Start point and end point on edge, not Node of graph in Path finding algorithm for Road Network Graph
I have a problem with algorithm for detection points which leg on the road between source and destination points.
There are a few assumptions for this:
- Starting from p0 (starting point) I want to move to pk (destination point)
- I have constraints for time and distance
- All of key points (p1, p2, p3, ..., pn) have weight (profit) corresponding to them (w1, w2, w3, ..., wn)
The question is how to detect which points are the most profitable? When I choose some points I would like to ask google navigation API if constraints are fulfilled but requests are expensive so it would be better for me not to do many of these.
Do you know any algorithm which is designed for solving such a problem?
---EDIT 1---
If I well understood you I should modify my problem to graph.
Still I don't know algorithm which allows me to solve this problem.
This is two-way graph (excluding connection to point p0 and pk). I would like to maximize profit and keep distance restrictions. Do you know any formal algorithm which could help me with it?
Example paths could be:
p0->3->2->1->pk
p0->1->pk
algorithm
asked Mar 8 at 16:16
konradokonrado
184
add a comment |
I have a problem with algorithm for detection points which leg on the road between source and destination points.
There are a few assumptions for this:
- Starting from p0 (starting point) I want to move to pk (destination point)
- I have constraints for time and distance
- All of key points (p1, p2, p3, ..., pn) have weight (profit) corresponding to them (w1, w2, w3, ..., wn)
The question is how to detect which points are the most profitable? When I choose some points I would like to ask google navigation API if constraints are fulfilled but requests are expensive so it would be better for me not to do many of these.
Do you know any algorithm which is designed for solving such a problem?
---EDIT 1---
If I well understood you I should modify my problem to graph.
Still I don't know algorithm which allows me to solve this problem.
This is two-way graph (excluding connection to point p0 and pk). I would like to maximize profit and keep distance restrictions. Do you know any formal algorithm which could help me with it?
Example paths could be:
p0->3->2->1->pk
p0->1->pk
algorithm
asked Mar 8 at 16:16
konradokonrado
184
Is there any reason why Dijkstra's would not work here?
– Mitchel Paulin
Mar 8 at 16:46
1
If you can approximate time and distance using point coordinates (which should be reasonably cheap), you can calculate a preliminary profit-maximizing path given your constraints. Then, look up the real distances and times for the edges on your path and update. Iterate until you get a path that has the real distances and times.
– Nico Schertler
Mar 8 at 16:52
Dijkstra works for graph. Here is situation where I have real road. I know only distances in straight line between points but not real. To know real distance I have to send request for google but I would like to avoid it to ask for all of roads.
– konrado
Mar 8 at 16:58
@NicoSchertler Do you have any proposals how to approximate real distance between two coordinates? Important thing is that distance between points could be very small (0.5 km)
– konrado
Mar 8 at 17:36
Just direct distance, measured through air.
– Nico Schertler
Mar 8 at 17:40
add a comment |
I have a problem with algorithm for detection points which leg on the road between source and destination points.
There are a few assumptions for this:
- Starting from p0 (starting point) I want to move to pk (destination point)
- I have constraints for time and distance
- All of key points (p1, p2, p3, ..., pn) have weight (profit) corresponding to them (w1, w2, w3, ..., wn)
The question is how to detect which points are the most profitable? When I choose some points I would like to ask google navigation API if constraints are fulfilled but requests are expensive so it would be better for me not to do many of these.
Do you know any algorithm which is designed for solving such a problem?
---EDIT 1---
If I well understood you I should modify my problem to graph.
Still I don't know algorithm which allows me to solve this problem.
This is two-way graph (excluding connection to point p0 and pk). I would like to maximize profit and keep distance restrictions. Do you know any formal algorithm which could help me with it?
Example paths could be:
p0->3->2->1->pk
p0->1->pk
algorithm
asked Mar 8 at 16:16
konradokonrado
184
I have a problem with algorithm for detection points which leg on the road between source and destination points.
There are a few assumptions for this:
- Starting from p0 (starting point) I want to move to pk (destination point)
- I have constraints for time and distance
- All of key points (p1, p2, p3, ..., pn) have weight (profit) corresponding to them (w1, w2, w3, ..., wn)
The question is how to detect which points are the most profitable? When I choose some points I would like to ask google navigation API if constraints are fulfilled but requests are expensive so it would be better for me not to do many of these.
Do you know any algorithm which is designed for solving such a problem?
---EDIT 1---
If I well understood you I should modify my problem to graph.
Still I don't know algorithm which allows me to solve this problem.
This is two-way graph (excluding connection to point p0 and pk). I would like to maximize profit and keep distance restrictions. Do you know any formal algorithm which could help me with it?
Example paths could be:
p0->3->2->1->pk
p0->1->pk
algorithm
algorithm
asked Mar 8 at 16:16
konradokonrado
184
asked Mar 8 at 16:16
konradokonrado
184
edited Mar 9 at 8:46
konrado
asked Mar 8 at 16:16
konradokonrado
184
asked Mar 8 at 16:16
konradokonrado
184
asked Mar 8 at 16:16
konradokonrado
184
184
Is there any reason why Dijkstra's would not work here?
– Mitchel Paulin
Mar 8 at 16:46
1
If you can approximate time and distance using point coordinates (which should be reasonably cheap), you can calculate a preliminary profit-maximizing path given your constraints. Then, look up the real distances and times for the edges on your path and update. Iterate until you get a path that has the real distances and times.
– Nico Schertler
Mar 8 at 16:52
Dijkstra works for graph. Here is situation where I have real road. I know only distances in straight line between points but not real. To know real distance I have to send request for google but I would like to avoid it to ask for all of roads.
– konrado
Mar 8 at 16:58
@NicoSchertler Do you have any proposals how to approximate real distance between two coordinates? Important thing is that distance between points could be very small (0.5 km)
– konrado
Mar 8 at 17:36
Just direct distance, measured through air.
– Nico Schertler
Mar 8 at 17:40
add a comment |
Is there any reason why Dijkstra's would not work here?
– Mitchel Paulin
Mar 8 at 16:46
1
If you can approximate time and distance using point coordinates (which should be reasonably cheap), you can calculate a preliminary profit-maximizing path given your constraints. Then, look up the real distances and times for the edges on your path and update. Iterate until you get a path that has the real distances and times.
– Nico Schertler
Mar 8 at 16:52
Dijkstra works for graph. Here is situation where I have real road. I know only distances in straight line between points but not real. To know real distance I have to send request for google but I would like to avoid it to ask for all of roads.
– konrado
Mar 8 at 16:58
@NicoSchertler Do you have any proposals how to approximate real distance between two coordinates? Important thing is that distance between points could be very small (0.5 km)
– konrado
Mar 8 at 17:36
Just direct distance, measured through air.
– Nico Schertler
Mar 8 at 17:40
Is there any reason why Dijkstra's would not work here?
– Mitchel Paulin
Mar 8 at 16:46
Is there any reason why Dijkstra's would not work here?
– Mitchel Paulin
Mar 8 at 16:46
1
1
If you can approximate time and distance using point coordinates (which should be reasonably cheap), you can calculate a preliminary profit-maximizing path given your constraints. Then, look up the real distances and times for the edges on your path and update. Iterate until you get a path that has the real distances and times.
– Nico Schertler
Mar 8 at 16:52
If you can approximate time and distance using point coordinates (which should be reasonably cheap), you can calculate a preliminary profit-maximizing path given your constraints. Then, look up the real distances and times for the edges on your path and update. Iterate until you get a path that has the real distances and times.
– Nico Schertler
Mar 8 at 16:52
Dijkstra works for graph. Here is situation where I have real road. I know only distances in straight line between points but not real. To know real distance I have to send request for google but I would like to avoid it to ask for all of roads.
– konrado
Mar 8 at 16:58
Dijkstra works for graph. Here is situation where I have real road. I know only distances in straight line between points but not real. To know real distance I have to send request for google but I would like to avoid it to ask for all of roads.
– konrado
Mar 8 at 16:58
@NicoSchertler Do you have any proposals how to approximate real distance between two coordinates? Important thing is that distance between points could be very small (0.5 km)
– konrado
Mar 8 at 17:36
@NicoSchertler Do you have any proposals how to approximate real distance between two coordinates? Important thing is that distance between points could be very small (0.5 km)
– konrado
Mar 8 at 17:36
Just direct distance, measured through air.
– Nico Schertler
Mar 8 at 17:40
Just direct distance, measured through air.
– Nico Schertler
Mar 8 at 17:40
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55067046%2falgorithm-for-on-road-key-points-detection%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55067046%2falgorithm-for-on-road-key-points-detection%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Is there any reason why Dijkstra's would not work here?
– Mitchel Paulin
Mar 8 at 16:46
1
If you can approximate time and distance using point coordinates (which should be reasonably cheap), you can calculate a preliminary profit-maximizing path given your constraints. Then, look up the real distances and times for the edges on your path and update. Iterate until you get a path that has the real distances and times.
– Nico Schertler
Mar 8 at 16:52
Dijkstra works for graph. Here is situation where I have real road. I know only distances in straight line between points but not real. To know real distance I have to send request for google but I would like to avoid it to ask for all of roads.
– konrado
Mar 8 at 16:58
@NicoSchertler Do you have any proposals how to approximate real distance between two coordinates? Important thing is that distance between points could be very small (0.5 km)
– konrado
Mar 8 at 17:36
Just direct distance, measured through air.
– Nico Schertler
Mar 8 at 17:40