InforLorV4, Main, Merge, bibRecord, 004561

Analyse d'un algorithme d'intelligence en essaim pour le fourragement

Identifieur interne : 004561 ( Main/Merge ); précédent : 004560; suivant : 004562

Analyse d'un algorithme d'intelligence en essaim pour le fourragement

Auteurs : Amine Boumaza [France] ; Bruno Scherrer [France]

Source :

Revue d'intelligence artificielle [ 0992-499X ] ; 2008.

RBID : Pascal:09-0030850

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Solution optimale, Système multiagent, Planification, Commande optimale, Contrôle optimal, Point fixe, Insecte social, Formicoidea, Analyse algorithme, Intelligence en essaim, Taux convergence, Convergence numérique, Modélisation, Méthode espace état, Contraction, ..
Wicri :
- topic : Intelligence artificielle.

English descriptors

KwdEn :
- Algorithm analysis, Artificial intelligence, Contraction, Convergence rate, Fix point, Formicoidea, Modeling, Multiagent system, Numerical convergence, Optimal control, Optimal control (mathematics), Optimal solution, Planning, Social insect, State space method, Swarm intelligence.

Abstract

We present a swarm intelligence algorithm that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the population computes the solution of some optimal control problem and that its dynamics converges. We discuss the rate of convergence with respect to the number of agents: we give experimental and theoretical arguments that suggest that this convergence rate is superlinear with respect to the number of agents. Furthermore, we explain how this model can be extended to the case where the state space is continuous, and in order to solve optimal control problems in general. We argue that such an approach can be applied to any problem that involves the computation of the fixed point of a contraction mapping. This allows to design a large class of formally well understood swarm intelligence algorithms.

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000285
to stream PascalFrancis, to step Curation: 000739
to stream PascalFrancis, to step Checkpoint: 000266

Links to Exploration step

Pascal:09-0030850

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" level="a">Analyse d'un algorithme d'intelligence en essaim pour le fourragement</title>
<author><name sortKey="Boumaza, Amine" sort="Boumaza, Amine" uniqKey="Boumaza A" first="Amine" last="Boumaza">Amine Boumaza</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Equipe MAIA, LORIA Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Scherrer, Bruno" sort="Scherrer, Bruno" uniqKey="Scherrer B" first="Bruno" last="Scherrer">Bruno Scherrer</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Equipe MAIA, LORIA Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">09-0030850</idno>
<date when="2008">2008</date>
<idno type="stanalyst">PASCAL 09-0030850 INIST</idno>
<idno type="RBID">Pascal:09-0030850</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000285</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000739</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000266</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000266</idno>
<idno type="wicri:doubleKey">0992-499X:2008:Boumaza A:analyse:d:un</idno>
<idno type="wicri:Area/Main/Merge">004561</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="fr" level="a">Analyse d'un algorithme d'intelligence en essaim pour le fourragement</title>
<author><name sortKey="Boumaza, Amine" sort="Boumaza, Amine" uniqKey="Boumaza A" first="Amine" last="Boumaza">Amine Boumaza</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Equipe MAIA, LORIA Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Scherrer, Bruno" sort="Scherrer, Bruno" uniqKey="Scherrer B" first="Bruno" last="Scherrer">Bruno Scherrer</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Equipe MAIA, LORIA Campus Scientifique BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Revue d'intelligence artificielle</title>
<title level="j" type="abbreviated">Rev. intell. artif.</title>
<idno type="ISSN">0992-499X</idno>
<imprint><date when="2008">2008</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Revue d'intelligence artificielle</title>
<title level="j" type="abbreviated">Rev. intell. artif.</title>
<idno type="ISSN">0992-499X</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm analysis</term>
<term>Artificial intelligence</term>
<term>Contraction</term>
<term>Convergence rate</term>
<term>Fix point</term>
<term>Formicoidea</term>
<term>Modeling</term>
<term>Multiagent system</term>
<term>Numerical convergence</term>
<term>Optimal control</term>
<term>Optimal control (mathematics)</term>
<term>Optimal solution</term>
<term>Planning</term>
<term>Social insect</term>
<term>State space method</term>
<term>Swarm intelligence</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Solution optimale</term>
<term>Système multiagent</term>
<term>Planification</term>
<term>Commande optimale</term>
<term>Contrôle optimal</term>
<term>Point fixe</term>
<term>Insecte social</term>
<term>Formicoidea</term>
<term>Analyse algorithme</term>
<term>Intelligence en essaim</term>
<term>Taux convergence</term>
<term>Convergence numérique</term>
<term>Modélisation</term>
<term>Méthode espace état</term>
<term>Contraction</term>
<term>.</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present a swarm intelligence algorithm that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the population computes the solution of some optimal control problem and that its dynamics converges. We discuss the rate of convergence with respect to the number of agents: we give experimental and theoretical arguments that suggest that this convergence rate is superlinear with respect to the number of agents. Furthermore, we explain how this model can be extended to the case where the state space is continuous, and in order to solve optimal control problems in general. We argue that such an approach can be applied to any problem that involves the computation of the fixed point of a contraction mapping. This allows to design a large class of formally well understood swarm intelligence algorithms.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Boumaza, Amine" sort="Boumaza, Amine" uniqKey="Boumaza A" first="Amine" last="Boumaza">Amine Boumaza</name>
</region>
<name sortKey="Scherrer, Bruno" sort="Scherrer, Bruno" uniqKey="Scherrer B" first="Bruno" last="Scherrer">Bruno Scherrer</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004561 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 004561 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:09-0030850
   |texte=   Analyse d'un algorithme d'intelligence en essaim pour le fourragement
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Analyse d'un algorithme d'intelligence en essaim pour le fourragement

Analyse d'un algorithme d'intelligence en essaim pour le fourragement

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri