How to calculate shortest path between multiple pick and drop destinations
up vote
0
down vote
favorite
I have a scenario where I have multiple robots, say 2 in this case and they have to pick and drop some items at specified locations as shown in
Figure.
There are two jobs to be done
1) pick up an object from A and drop at B
2) pick up an object from C and drop at D
The possible routes are
A->B-C->D
A->C->B->D
A->C->D->B
C->D->A->B
C->A->D->B
C->A->B->D
I am a beginner in path planning and am finding it difficult to come up with a solution that can work in this case. I can use dikstra and A* etc to find all possible paths but in my case I have a constraint that the destination node cant be reached if the source node for that particular destination node hasnt been visited first.
algorithm graph path-finding shortest
asked Nov 20 at 12:50
Zain
65
add a comment |
up vote
0
down vote
favorite
I have a scenario where I have multiple robots, say 2 in this case and they have to pick and drop some items at specified locations as shown in
Figure.
There are two jobs to be done
1) pick up an object from A and drop at B
2) pick up an object from C and drop at D
The possible routes are
A->B-C->D
A->C->B->D
A->C->D->B
C->D->A->B
C->A->D->B
C->A->B->D
I am a beginner in path planning and am finding it difficult to come up with a solution that can work in this case. I can use dikstra and A* etc to find all possible paths but in my case I have a constraint that the destination node cant be reached if the source node for that particular destination node hasnt been visited first.
algorithm graph path-finding shortest
asked Nov 20 at 12:50
Zain
65
Travelling Salesman Problem?
– meowgoesthedog
Nov 20 at 13:34
Thanks I will have a look at it.
– Zain
Nov 20 at 13:40
If you have several agents taking care of the deliveries, it might be closer to the vehicule routing problem than to the TSP. Check the VRPPD problem in particular.
– m.raynal
Nov 20 at 14:07
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I have a scenario where I have multiple robots, say 2 in this case and they have to pick and drop some items at specified locations as shown in
Figure.
There are two jobs to be done
1) pick up an object from A and drop at B
2) pick up an object from C and drop at D
The possible routes are
A->B-C->D
A->C->B->D
A->C->D->B
C->D->A->B
C->A->D->B
C->A->B->D
I am a beginner in path planning and am finding it difficult to come up with a solution that can work in this case. I can use dikstra and A* etc to find all possible paths but in my case I have a constraint that the destination node cant be reached if the source node for that particular destination node hasnt been visited first.
algorithm graph path-finding shortest
asked Nov 20 at 12:50
Zain
65
I have a scenario where I have multiple robots, say 2 in this case and they have to pick and drop some items at specified locations as shown in
Figure.
There are two jobs to be done
1) pick up an object from A and drop at B
2) pick up an object from C and drop at D
The possible routes are
A->B-C->D
A->C->B->D
A->C->D->B
C->D->A->B
C->A->D->B
C->A->B->D
I am a beginner in path planning and am finding it difficult to come up with a solution that can work in this case. I can use dikstra and A* etc to find all possible paths but in my case I have a constraint that the destination node cant be reached if the source node for that particular destination node hasnt been visited first.
algorithm graph path-finding shortest
algorithm graph path-finding shortest
asked Nov 20 at 12:50
Zain
65
asked Nov 20 at 12:50
Zain
65
edited Nov 20 at 12:53
asked Nov 20 at 12:50
Zain
65
asked Nov 20 at 12:50
Zain
65
asked Nov 20 at 12:50
Zain
65
65
Travelling Salesman Problem?
– meowgoesthedog
Nov 20 at 13:34
Thanks I will have a look at it.
– Zain
Nov 20 at 13:40
If you have several agents taking care of the deliveries, it might be closer to the vehicule routing problem than to the TSP. Check the VRPPD problem in particular.
– m.raynal
Nov 20 at 14:07
add a comment |
Travelling Salesman Problem?
– meowgoesthedog
Nov 20 at 13:34
Thanks I will have a look at it.
– Zain
Nov 20 at 13:40
If you have several agents taking care of the deliveries, it might be closer to the vehicule routing problem than to the TSP. Check the VRPPD problem in particular.
– m.raynal
Nov 20 at 14:07
Travelling Salesman Problem?
– meowgoesthedog
Nov 20 at 13:34
Travelling Salesman Problem?
– meowgoesthedog
Nov 20 at 13:34
Thanks I will have a look at it.
– Zain
Nov 20 at 13:40
Thanks I will have a look at it.
– Zain
Nov 20 at 13:40
If you have several agents taking care of the deliveries, it might be closer to the vehicule routing problem than to the TSP. Check the VRPPD problem in particular.
– m.raynal
Nov 20 at 14:07
If you have several agents taking care of the deliveries, it might be closer to the vehicule routing problem than to the TSP. Check the VRPPD problem in particular.
– m.raynal
Nov 20 at 14:07
add a comment |
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',
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%2f53393388%2fhow-to-calculate-shortest-path-between-multiple-pick-and-drop-destinations%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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%2f53393388%2fhow-to-calculate-shortest-path-between-multiple-pick-and-drop-destinations%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
Travelling Salesman Problem?
– meowgoesthedog
Nov 20 at 13:34
Thanks I will have a look at it.
– Zain
Nov 20 at 13:40
If you have several agents taking care of the deliveries, it might be closer to the vehicule routing problem than to the TSP. Check the VRPPD problem in particular.
– m.raynal
Nov 20 at 14:07