Non-commutative path planning strategy

Chang Wu Yu, Rei Heng Cheng, Tung Kuang Wu, Huai Tse Chang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publication2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages33-37
Number of pages5
ISBN (Electronic)9781467382700
DOIs
Publication statusPublished - 2015 Oct 12
Event8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Colombo, Sri Lanka
Duration: 2015 Aug 242015 Aug 26

Publication series

Name2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings

Other

Other8th International Conference on Ubi-Media Computing, UMEDIA 2015
CountrySri Lanka
CityColombo
Period15-08-2415-08-26

Fingerprint

Motion planning
Function evaluation

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Cite this

Yu, C. W., Cheng, R. H., Wu, T. K., & Chang, H. T. (2015). Non-commutative path planning strategy. In 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings (pp. 33-37). [7297424] (2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/UMEDIA.2015.7297424
Yu, Chang Wu ; Cheng, Rei Heng ; Wu, Tung Kuang ; Chang, Huai Tse. / Non-commutative path planning strategy. 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 33-37 (2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings).
@inproceedings{72826e46db434d8bb44044d859dbeae5,
title = "Non-commutative path planning strategy",
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.",
author = "Yu, {Chang Wu} and Cheng, {Rei Heng} and Wu, {Tung Kuang} and Chang, {Huai Tse}",
year = "2015",
month = "10",
day = "12",
doi = "10.1109/UMEDIA.2015.7297424",
language = "English",
series = "2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "33--37",
booktitle = "2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings",
address = "United States",

}

Yu, CW, Cheng, RH, Wu, TK & Chang, HT 2015, Non-commutative path planning strategy. in 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings., 7297424, 2015 8th International Conference on Ubi-Media Computing, UMEDIA 2015 - Conference Proceeedings, Institute of Electrical and Electronics Engineers Inc., pp. 33-37, 8th International Conference on Ubi-Media Computing, UMEDIA 2015, Colombo, Sri Lanka, 15-08-24. https://doi.org/10.1109/UMEDIA.2015.7297424

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 proceedingConference 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 -

Yu CW, Cheng RH, Wu TK, Chang HT. Non-commutative path planning strategy. In 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). https://doi.org/10.1109/UMEDIA.2015.7297424