Paper Abstract and Keywords |
Presentation |
2011-11-11 11:00
A dynamic path finding method using reward distribution agents Yuta Sugiyama, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2011-114 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Recently, the wireless communication technology has attracted significant attention. In wireless networks, each wireless node can be a relay node and the networks can be constructed without the existing infrastructure. However, in dynamic environments such as mobile ad-hoc networks, it is difficult to construct and maintain the networks because each wireless node move autonomously. In this article, we propose a dynamic path finding method based on Profit Sharing (PS) which is a kind of reinforcement learning algorithms. The PS has a simple algorithm, and is relatively robust for dynamic environments. In the numerical simulations, the proposed method is compared with the conventional ACO method, and the effectiveness of the proposed method is shown. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Reinforcement Learning / Profit Sharing / Path Routing / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 111, no. 276, NLP2011-114, pp. 125-128, Nov. 2011. |
Paper # |
NLP2011-114 |
Date of Issue |
2011-11-02 (NLP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
NLP2011-114 |
Conference Information |
Committee |
NLP |
Conference Date |
2011-11-09 - 2011-11-11 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Miyako Island Marine Terminal |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
General |
Paper Information |
Registration To |
NLP |
Conference Code |
2011-11-NLP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
A dynamic path finding method using reward distribution agents |
Sub Title (in English) |
|
Keyword(1) |
Reinforcement Learning |
Keyword(2) |
Profit Sharing |
Keyword(3) |
Path Routing |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yuta Sugiyama |
1st Author's Affiliation |
Tokyo City University (Tokyo City Univ.) |
2nd Author's Name |
Hidehiro Nakano |
2nd Author's Affiliation |
Tokyo City University (Tokyo City Univ.) |
3rd Author's Name |
Arata Miyauchi |
3rd Author's Affiliation |
Tokyo City University (Tokyo City Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2011-11-11 11:00:00 |
Presentation Time |
25 minutes |
Registration for |
NLP |
Paper # |
NLP2011-114 |
Volume (vol) |
vol.111 |
Number (no) |
no.276 |
Page |
pp.125-128 |
#Pages |
4 |
Date of Issue |
2011-11-02 (NLP) |
|