Abstract
Over the years, various path planning problems have been brought up and addressed. For example, shortest path first algorithm is usually adopted to search for the best route between a source and a destination for packet transmission over a network. In that case, we add up the distance of every segment along each of the available routes and choose the one with the least value. Path planning problems of this sort often use evaluation functions that are commutative in nature. However, in case our objective is to plan a biking or driving route that is safe and / or fun, ordinary evaluation functions, especially commutative ones, usually fail to resolve the issue properly. Accordingly, in this paper, we propose an un-conventional noncommutative path planning strategy as well as algorithm to address the problem in a more efficient manner.
| Original language | English |
|---|---|
| Title of host publication | 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 33-37 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781467382700 |
| DOIs | |
| Publication status | Published - 2015 Oct 12 |
| Event | 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Colombo, Sri Lanka Duration: 2015 Aug 24 → 2015 Aug 26 |
Publication series
| Name | 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings |
|---|
Other
| Other | 8th International Conference on Ubi-Media Computing, UMEDIA 2015 |
|---|---|
| Country | Sri Lanka |
| City | Colombo |
| Period | 15-08-24 → 15-08-26 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Software
Cite this
}
Non-commutative path planning strategy. / Yu, Chang Wu; Cheng, Rei Heng; Wu, Tung Kuang; Chang, Huai Tse.
2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings. Institute of Electrical and Electronics Engineers Inc., 2015. p. 33-37 7297424 (2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Non-commutative path planning strategy
AU - Yu, Chang Wu
AU - Cheng, Rei Heng
AU - Wu, Tung Kuang
AU - Chang, Huai Tse
PY - 2015/10/12
Y1 - 2015/10/12
N2 - Over the years, various path planning problems have been brought up and addressed. For example, shortest path first algorithm is usually adopted to search for the best route between a source and a destination for packet transmission over a network. In that case, we add up the distance of every segment along each of the available routes and choose the one with the least value. Path planning problems of this sort often use evaluation functions that are commutative in nature. However, in case our objective is to plan a biking or driving route that is safe and / or fun, ordinary evaluation functions, especially commutative ones, usually fail to resolve the issue properly. Accordingly, in this paper, we propose an un-conventional noncommutative path planning strategy as well as algorithm to address the problem in a more efficient manner.
AB - Over the years, various path planning problems have been brought up and addressed. For example, shortest path first algorithm is usually adopted to search for the best route between a source and a destination for packet transmission over a network. In that case, we add up the distance of every segment along each of the available routes and choose the one with the least value. Path planning problems of this sort often use evaluation functions that are commutative in nature. However, in case our objective is to plan a biking or driving route that is safe and / or fun, ordinary evaluation functions, especially commutative ones, usually fail to resolve the issue properly. Accordingly, in this paper, we propose an un-conventional noncommutative path planning strategy as well as algorithm to address the problem in a more efficient manner.
UR - http://www.scopus.com/inward/record.url?scp=84959525756&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959525756&partnerID=8YFLogxK
U2 - 10.1109/UMEDIA.2015.7297424
DO - 10.1109/UMEDIA.2015.7297424
M3 - Conference contribution
AN - SCOPUS:84959525756
T3 - 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings
SP - 33
EP - 37
BT - 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings
PB - Institute of Electrical and Electronics Engineers Inc.
ER -