A path planning method for micro robot soccer game

T. H. Lee; H. K. Lam; Hung Fat Frank Leung; P. K.S. Tam

A path planning method for micro robot soccer game

T. H. Lee, H. K. Lam, Hung Fat Frank Leung, P. K.S. Tam

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

2 Citations (Scopus)

Abstract

This paper describes the design and development of a path planning method for Micro Robot Soccer Tournament (MIROSOT). Every object in the stadium is given a working layer which is decomposed into a fixed number of small areas. We propose to assign values to different small areas of the layer according to the object's movement. The final path is obtained by combining the small areas of the layers and getting the path with the smallest values. Since the host computer uses only a simple equation to calculate the value of each small area, this algorithm requires only a low computing power, and the speed of path generation is very fast. A simulation program has been developed to test the algorithm's performance.

Original language	English
Title of host publication	IECON Proceedings (Industrial Electronics Conference)
Pages	626-629
Number of pages	4
Publication status	Published - 1 Dec 2001
Event	27th Annual Conference of the IEEE Industrial Electronics Society IECON'2001 - Denver, CO, United States Duration: 29 Nov 2001 → 2 Dec 2001

Conference

Conference	27th Annual Conference of the IEEE Industrial Electronics Society IECON'2001
Country/Territory	United States
City	Denver, CO
Period	29/11/01 → 2/12/01

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

More information

http://hdl.handle.net/10397/1370

Cite this

@inproceedings{5d2479f1c2c0404baf5d8528d9640835,

title = "A path planning method for micro robot soccer game",

abstract = "This paper describes the design and development of a path planning method for Micro Robot Soccer Tournament (MIROSOT). Every object in the stadium is given a working layer which is decomposed into a fixed number of small areas. We propose to assign values to different small areas of the layer according to the object's movement. The final path is obtained by combining the small areas of the layers and getting the path with the smallest values. Since the host computer uses only a simple equation to calculate the value of each small area, this algorithm requires only a low computing power, and the speed of path generation is very fast. A simulation program has been developed to test the algorithm's performance.",

author = "Lee, {T. H.} and Lam, {H. K.} and Leung, {Hung Fat Frank} and Tam, {P. K.S.}",

year = "2001",

month = dec,

day = "1",

language = "English",

pages = "626--629",

booktitle = "IECON Proceedings (Industrial Electronics Conference)",

note = "27th Annual Conference of the IEEE Industrial Electronics Society IECON'2001 ; Conference date: 29-11-2001 Through 02-12-2001",

}

TY - GEN

T1 - A path planning method for micro robot soccer game

AU - Lee, T. H.

AU - Lam, H. K.

AU - Leung, Hung Fat Frank

AU - Tam, P. K.S.

PY - 2001/12/1

Y1 - 2001/12/1

N2 - This paper describes the design and development of a path planning method for Micro Robot Soccer Tournament (MIROSOT). Every object in the stadium is given a working layer which is decomposed into a fixed number of small areas. We propose to assign values to different small areas of the layer according to the object's movement. The final path is obtained by combining the small areas of the layers and getting the path with the smallest values. Since the host computer uses only a simple equation to calculate the value of each small area, this algorithm requires only a low computing power, and the speed of path generation is very fast. A simulation program has been developed to test the algorithm's performance.

AB - This paper describes the design and development of a path planning method for Micro Robot Soccer Tournament (MIROSOT). Every object in the stadium is given a working layer which is decomposed into a fixed number of small areas. We propose to assign values to different small areas of the layer according to the object's movement. The final path is obtained by combining the small areas of the layers and getting the path with the smallest values. Since the host computer uses only a simple equation to calculate the value of each small area, this algorithm requires only a low computing power, and the speed of path generation is very fast. A simulation program has been developed to test the algorithm's performance.

UR - http://www.scopus.com/inward/record.url?scp=0035690125&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SP - 626

EP - 629

BT - IECON Proceedings (Industrial Electronics Conference)

T2 - 27th Annual Conference of the IEEE Industrial Electronics Society IECON'2001

Y2 - 29 November 2001 through 2 December 2001

ER -

A path planning method for micro robot soccer game

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this