Non-prespecified Starting Depot Formulations for Minimum-Distance Trajectory Optimization in Patrolling Problem

Non-prespecified Starting Depot Formulations for Minimum-Distance Trajectory Optimization in... In this paper, two new formulations are presented for trajectory optimization in the patrolling problem. It is assumed that the starting depot is not prespecified; an assumption that distinguishes the present work from the existing literature. A number of viewpoints are assigned to be visited in a certain sequence to minimize the total travel distance. The problem turns out to be a variant of the well-known Traveling Salesmen Problem (TSP), namely the Single depot multiple Traveling Salesmen Problem (mTSP). Comparisons between the commonly-used prespecified starting depot approach and the proposed formulations are performed and the efficacy of the results is presented through simulations. It is noted that by using the new approach, the total travel distance can be improved by an average of about 20 % compared to the case where the starting depot is prespecified, and by about 40 % in the worst-case scenario (in terms of the starting depot). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Intelligent & Robotic Systems Springer Journals

Non-prespecified Starting Depot Formulations for Minimum-Distance Trajectory Optimization in Patrolling Problem

Loading next page...
 
/lp/springer_journal/non-prespecified-starting-depot-formulations-for-minimum-distance-8QIE02TNRa
Publisher
Springer Netherlands
Copyright
Copyright © 2017 by Springer Science+Business Media Dordrecht
Subject
Engineering; Control, Robotics, Mechatronics; Electrical Engineering; Artificial Intelligence (incl. Robotics); Mechanical Engineering
ISSN
0921-0296
eISSN
1573-0409
D.O.I.
10.1007/s10846-017-0496-7
Publisher site
See Article on Publisher Site

Abstract

In this paper, two new formulations are presented for trajectory optimization in the patrolling problem. It is assumed that the starting depot is not prespecified; an assumption that distinguishes the present work from the existing literature. A number of viewpoints are assigned to be visited in a certain sequence to minimize the total travel distance. The problem turns out to be a variant of the well-known Traveling Salesmen Problem (TSP), namely the Single depot multiple Traveling Salesmen Problem (mTSP). Comparisons between the commonly-used prespecified starting depot approach and the proposed formulations are performed and the efficacy of the results is presented through simulations. It is noted that by using the new approach, the total travel distance can be improved by an average of about 20 % compared to the case where the starting depot is prespecified, and by about 40 % in the worst-case scenario (in terms of the starting depot).

Journal

Journal of Intelligent & Robotic SystemsSpringer Journals

Published: Feb 10, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off