Path planning problem on weighted graph with prizes

Sergey Zhukov; Mikhail Glazyrin; Pavel Kuznetsov

doi:10.1117/12.518099

10 October 2003 Path planning problem on weighted graph with prizes

Sergey Zhukov, Mikhail Glazyrin, Pavel Kuznetsov

Proceedings Volume 5127, Sixth International Workshop on Nondestructive Testing and Computer Simulations in Science and Engineering; (2003) https://doi.org/10.1117/12.518099
Event: Sixth International Workshop on Nondestructive Testing and Computer Simulations in Science and Engineering, 2002, St. Petersburg, Russian Federation

Abstract

In this article we formalize and consider the path-planning problem on the weighted graph with prizes (PCPP - prize collecting path-planning). It is generalized travel salesman problem on graph with prizes. We give the formal statement of the PCPP problem and prove that it is NP-hard. We developed the algorihtm to resolve the PCPP problem exactly if graph is a tree and proposed several heuristics based on this algorithm to resolve the problem in common case.

Citation Download Citation

Sergey Zhukov, Mikhail Glazyrin, and Pavel Kuznetsov "Path planning problem on weighted graph with prizes", Proc. SPIE 5127, Sixth International Workshop on Nondestructive Testing and Computer Simulations in Science and Engineering, (10 October 2003); https://doi.org/10.1117/12.518099

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available