Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks
Identifieur interne : 003036 ( Istex/Corpus ); précédent : 003035; suivant : 003037Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks
Auteurs : Bjarne E. Helvik ; Otto WittnerSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
Abstract
Abstract: The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.
Url:
DOI: 10.1007/3-540-44651-6_24
Links to Exploration step
ISTEX:8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title><author><name sortKey="Helvik, Bjarne E" sort="Helvik, Bjarne E" uniqKey="Helvik B" first="Bjarne E." last="Helvik">Bjarne E. Helvik</name><affiliation><mods:affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bjarne@item.ntnu.no</mods:affiliation></affiliation></author><author><name sortKey="Wittner, Otto" sort="Wittner, Otto" uniqKey="Wittner O" first="Otto" last="Wittner">Otto Wittner</name><affiliation><mods:affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: wittner@item.ntnu.no</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-44651-6_24</idno><idno type="url">https://api.istex.fr/document/8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003036</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003036</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title><author><name sortKey="Helvik, Bjarne E" sort="Helvik, Bjarne E" uniqKey="Helvik B" first="Bjarne E." last="Helvik">Bjarne E. Helvik</name><affiliation><mods:affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bjarne@item.ntnu.no</mods:affiliation></affiliation></author><author><name sortKey="Wittner, Otto" sort="Wittner, Otto" uniqKey="Wittner O" first="Otto" last="Wittner">Otto Wittner</name><affiliation><mods:affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: wittner@item.ntnu.no</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1</idno><idno type="DOI">10.1007/3-540-44651-6_24</idno><idno type="ChapterID">24</idno><idno type="ChapterID">Chap24</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Bjarne E. Helvik</name><affiliations><json:string>Department of Telematics, Norwegian University of Science and Technology, Norway</json:string><json:string>E-mail: bjarne@item.ntnu.no</json:string></affiliations></json:item><json:item><name>Otto Wittner</name><affiliations><json:string>Department of Telematics, Norwegian University of Science and Technology, Norway</json:string><json:string>E-mail: wittner@item.ntnu.no</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.</abstract><qualityIndicators><score>6.692</score><pdfVersion>1.3</pdfVersion><pdfPageSize>451.008 x 677 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>966</abstractCharCount><pdfWordCount>5629</pdfWordCount><pdfCharCount>30124</pdfCharCount><pdfPageCount>14</pdfPageCount><abstractWordCount>141</abstractWordCount></qualityIndicators><title>Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>24</json:string><json:string>Chap24</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2001</copyrightDate></serie><host><editor><json:item><name>Samuel Pierre</name><affiliations><json:string>Mobile Computing and Networking Research Laboratory (LARIM) Department of Computer Engineering, Ecole Polytechnique de Montreal, P.O. Box 6079, Station Centre-Ville, H3C 3A7, Montreal, (Quebec), Canada</json:string><json:string>E-mail: Samuel.Pierre@polymtl.ca</json:string></affiliations></json:item><json:item><name>Roch Glitho</name><affiliations><json:string>Ericsson Research Canada, 8400 Decarie Blvd., H4P 2N2, Town of Mount Royal, (Quebec), Canada</json:string><json:string>E-mail: Roch.Glitho@ericsson.ca</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Multimedia Information Systems</value></json:item><json:item><value>Business Information Systems</value></json:item><json:item><value>Communications Engineering, Networks</value></json:item></subject><isbn><json:string>978-3-540-42460-4</json:string></isbn><language><json:string>unknown</json:string></language><title>Mobile Agents for Telecommunication Applications</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>3-540-44651-6</json:string></bookId><volume>2164</volume><pages><last>268</last><first>255</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-44651-4</json:string></eisbn><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-44651-6</json:string></doi></host><publicationDate>2001</publicationDate><copyrightDate>2001</copyrightDate><doi><json:string>10.1007/3-540-44651-6_24</json:string></doi><id>8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1</id><score>1</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2001</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title><author><persName><forename type="first">Bjarne</forename><surname>Helvik</surname></persName><email>bjarne@item.ntnu.no</email><affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</affiliation></author><author><persName><forename type="first">Otto</forename><surname>Wittner</surname></persName><email>wittner@item.ntnu.no</email><affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</affiliation></author></analytic><monogr><title level="m">Mobile Agents for Telecommunication Applications</title><title level="m" type="sub">Third International Workshop, MATA 2001 Montreal, Canada, August 14–16, 2001 Proceedings</title><idno type="pISBN">978-3-540-42460-4</idno><idno type="eISBN">978-3-540-44651-4</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-44651-6</idno><idno type="BookID">3-540-44651-6</idno><idno type="BookTitleID">69454</idno><idno type="BookSequenceNumber">2164</idno><idno type="BookVolumeNumber">2164</idno><idno type="BookChapterCount">26</idno><editor><persName><forename type="first">Samuel</forename><surname>Pierre</surname></persName><email>Samuel.Pierre@polymtl.ca</email><affiliation>Mobile Computing and Networking Research Laboratory (LARIM) Department of Computer Engineering, Ecole Polytechnique de Montreal, P.O. Box 6079, Station Centre-Ville, H3C 3A7, Montreal, (Quebec), Canada</affiliation></editor><editor><persName><forename type="first">Roch</forename><surname>Glitho</surname></persName><email>Roch.Glitho@ericsson.ca</email><affiliation>Ericsson Research Canada, 8400 Decarie Blvd., H4P 2N2, Town of Mount Royal, (Quebec), Canada</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2001"></date><biblScope unit="volume">2164</biblScope><biblScope unit="page" from="255">255</biblScope><biblScope unit="page" to="268">268</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Utrecht University, The Netherlands</affiliation></editor><biblScope><date>2001</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="seriesId">558</idno></series><idno type="istex">8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1</idno><idno type="DOI">10.1007/3-540-44651-6_24</idno><idno type="ChapterID">24</idno><idno type="ChapterID">Chap24</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2001</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I13022</label><label>I21017</label><label>I18040</label><label>I18059</label><label>W26007</label><label>T24035</label><item><term>Computer Science</term></item><item><term>Computer Communication Networks</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Information Systems Applications (incl.Internet)</term></item><item><term>Multimedia Information Systems</term></item><item><term>Business Information Systems</term></item><item><term>Communications Engineering, Networks</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2001">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-19">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-44651-6</BookID><BookTitle>Mobile Agents for Telecommunication Applications</BookTitle><BookSubTitle>Third International Workshop, MATA 2001 Montreal, Canada, August 14–16, 2001 Proceedings</BookSubTitle><BookVolumeNumber>2164</BookVolumeNumber><BookSequenceNumber>2164</BookSequenceNumber><BookDOI>10.1007/3-540-44651-6</BookDOI><BookTitleID>69454</BookTitleID><BookPrintISBN>978-3-540-42460-4</BookPrintISBN><BookElectronicISBN>978-3-540-44651-4</BookElectronicISBN><BookChapterCount>26</BookChapterCount><BookHistory><OnlineDate><Year>2002</Year><Month>10</Month><Day>10</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I13022" Priority="1" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I21017" Priority="2" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I18040" Priority="3" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18059" Priority="4" Type="Secondary">Multimedia Information Systems</BookSubject><BookSubject Code="W26007" Priority="5" Type="Secondary">Business Information Systems</BookSubject><BookSubject Code="T24035" Priority="6" Type="Secondary">Communications Engineering, Networks</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Samuel</GivenName><FamilyName>Pierre</FamilyName></EditorName><Contact><Email>Samuel.Pierre@polymtl.ca</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Roch</GivenName><FamilyName>Glitho</FamilyName></EditorName><Contact><Email>Roch.Glitho@ericsson.ca</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>Mobile Computing and Networking Research Laboratory (LARIM) Department of Computer Engineering</OrgDivision><OrgName>Ecole Polytechnique de Montreal</OrgName><OrgAddress><Postbox>P.O. Box 6079, Station Centre-Ville</Postbox><City>Montreal</City><State>(Quebec)</State><Country>Canada</Country><Postcode>H3C 3A7</Postcode></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>Ericsson Research Canada</OrgName><OrgAddress><Street>8400 Decarie Blvd.</Street><City>Town of Mount Royal</City><State>(Quebec)</State><Country>Canada</Country><Postcode>H4P 2N2</Postcode></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap24" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>24</ChapterID><ChapterDOI>10.1007/3-540-44651-6_24</ChapterDOI><ChapterSequenceNumber>24</ChapterSequenceNumber><ChapterTitle Language="En">Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</ChapterTitle><ChapterFirstPage>255</ChapterFirstPage><ChapterLastPage>268</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2001</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2002</Year><Month>10</Month><Day>9</Day></RegistrationDate><OnlineDate><Year>2002</Year><Month>10</Month><Day>10</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3-540-44651-6</BookID><BookTitle>Mobile Agents for Telecommunication Applications</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Bjarne</GivenName><GivenName>E.</GivenName><FamilyName>Helvik</FamilyName></AuthorName><Contact><Email>bjarne@item.ntnu.no</Email></Contact></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Otto</GivenName><FamilyName>Wittner</FamilyName></AuthorName><Contact><Email>wittner@item.ntnu.no</Email></Contact></Author><Affiliation ID="Aff6"><OrgDivision>Department of Telematics</OrgDivision><OrgName>Norwegian University of Science and Technology</OrgName><OrgAddress><Country>Norway</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks</title></titleInfo><name type="personal"><namePart type="given">Bjarne</namePart><namePart type="given">E.</namePart><namePart type="family">Helvik</namePart><affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</affiliation><affiliation>E-mail: bjarne@item.ntnu.no</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Otto</namePart><namePart type="family">Wittner</namePart><affiliation>Department of Telematics, Norwegian University of Science and Technology, Norway</affiliation><affiliation>E-mail: wittner@item.ntnu.no</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2001</dateIssued><copyrightDate encoding="w3cdtf">2001</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The problem of finding paths in networks is general and many faceted with a wide range of engineering applications in communication networks. Finding the optimal path or combination of paths usually leads to NP-hard combinatorial optimization problems. A recent and promising method, the cross-entropy method proposed by Rubinstein, manages to produce optimal solutions to such problems in polynomial time. However this algorithm is centralized and batch oriented. In this paper we show how the cross-entropy method can be reformulated to govern the behaviour of multiple mobile agents which act independently and asynchronously of each other. The new algorithm is evaluate on a set of well known Travelling Salesman Problems. A simulator, based on the Network Simulator package, has been implemented which provide realistic simulation environments. Results show good performance and stable convergence towards near optimal solution of the problems tested.</abstract><relatedItem type="host"><titleInfo><title>Mobile Agents for Telecommunication Applications</title><subTitle>Third International Workshop, MATA 2001 Montreal, Canada, August 14–16, 2001 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Samuel</namePart><namePart type="family">Pierre</namePart><affiliation>Mobile Computing and Networking Research Laboratory (LARIM) Department of Computer Engineering, Ecole Polytechnique de Montreal, P.O. Box 6079, Station Centre-Ville, H3C 3A7, Montreal, (Quebec), Canada</affiliation><affiliation>E-mail: Samuel.Pierre@polymtl.ca</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Roch</namePart><namePart type="family">Glitho</namePart><affiliation>Ericsson Research Canada, 8400 Decarie Blvd., H4P 2N2, Town of Mount Royal, (Quebec), Canada</affiliation><affiliation>E-mail: Roch.Glitho@ericsson.ca</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18059">Multimedia Information Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="W26007">Business Information Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="T24035">Communications Engineering, Networks</topic></subject><identifier type="DOI">10.1007/3-540-44651-6</identifier><identifier type="ISBN">978-3-540-42460-4</identifier><identifier type="eISBN">978-3-540-44651-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">69454</identifier><identifier type="BookID">3-540-44651-6</identifier><identifier type="BookChapterCount">26</identifier><identifier type="BookVolumeNumber">2164</identifier><identifier type="BookSequenceNumber">2164</identifier><part><date>2001</date><detail type="volume"><number>2164</number><caption>vol.</caption></detail><extent unit="pages"><start>255</start><end>268</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2001</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></relatedItem><identifier type="istex">8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1</identifier><identifier type="DOI">10.1007/3-540-44651-6_24</identifier><identifier type="ChapterID">24</identifier><identifier type="ChapterID">Chap24</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003036 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003036 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:8AAF70A4EEDC5E11808518960B53DC10CE2D1CC1
|texte= Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks
}}
| This area was generated with Dilib version V0.6.31. |  |