Analyse d'un algorithme d'intelligence en essaim pour le fourragement
Identifieur interne : 000739 ( PascalFrancis/Curation ); précédent : 000738; suivant : 000740Analyse 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.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle.
English descriptors
- KwdEn :
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.
pA |
|
---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000285
Links to Exploration step
Pascal:09-0030850Le 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="1"><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>
</affiliation>
</author>
<author><name sortKey="Scherrer, Bruno" sort="Scherrer, Bruno" uniqKey="Scherrer B" first="Bruno" last="Scherrer">Bruno Scherrer</name>
<affiliation wicri:level="1"><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>
</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>
</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="1"><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>
</affiliation>
</author>
<author><name sortKey="Scherrer, Bruno" sort="Scherrer, Bruno" uniqKey="Scherrer B" first="Bruno" last="Scherrer">Bruno Scherrer</name>
<affiliation wicri:level="1"><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>
</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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0992-499X</s0>
</fA01>
<fA03 i2="1"><s0>Rev. intell. artif.</s0>
</fA03>
<fA05><s2>22</s2>
</fA05>
<fA06><s2>6</s2>
</fA06>
<fA08 i1="01" i2="1" l="FRE"><s1>Analyse d'un algorithme d'intelligence en essaim pour le fourragement</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BOUMAZA (Amine)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SCHERRER (Bruno)</s1>
</fA11>
<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>
</fA14>
<fA20><s1>791-816</s1>
</fA20>
<fA21><s1>2008</s1>
</fA21>
<fA23 i1="01"><s0>FRE</s0>
</fA23>
<fA24 i1="01"><s0>eng</s0>
</fA24>
<fA43 i1="01"><s1>INIST</s1>
<s2>21320</s2>
<s5>354000183981650040</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2009 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>09-0030850</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Revue d'intelligence artificielle</s0>
</fA64>
<fA66 i1="01"><s0>FRA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02B04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Solution optimale</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Optimal solution</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Solución óptima</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Système multiagent</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Multiagent system</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Sistema multiagente</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Planification</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Planning</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Planificación</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Commande optimale</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Optimal control</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Control óptimo</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Contrôle optimal</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Optimal control (mathematics)</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Control óptimo (matemáticas)</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Point fixe</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Fix point</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Punto fijo</s0>
<s5>20</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Insecte social</s0>
<s5>21</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Social insect</s0>
<s5>21</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Insecto social</s0>
<s5>21</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Formicoidea</s0>
<s2>NS</s2>
<s5>22</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Formicoidea</s0>
<s2>NS</s2>
<s5>22</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Formicoidea</s0>
<s2>NS</s2>
<s5>22</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Analyse algorithme</s0>
<s5>23</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Algorithm analysis</s0>
<s5>23</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Análisis algoritmo</s0>
<s5>23</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Intelligence en essaim</s0>
<s5>24</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Swarm intelligence</s0>
<s5>24</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Inteligencia de enjambre</s0>
<s5>24</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Taux convergence</s0>
<s5>25</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Convergence rate</s0>
<s5>25</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Relación convergencia</s0>
<s5>25</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Convergence numérique</s0>
<s5>26</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Numerical convergence</s0>
<s5>26</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Convergencia numérica</s0>
<s5>26</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>27</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Modeling</s0>
<s5>27</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Modelización</s0>
<s5>27</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>Méthode espace état</s0>
<s5>28</s5>
</fC03>
<fC03 i1="15" i2="X" l="ENG"><s0>State space method</s0>
<s5>28</s5>
</fC03>
<fC03 i1="15" i2="X" l="SPA"><s0>Método espacio estado</s0>
<s5>28</s5>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Contraction</s0>
<s5>29</s5>
</fC03>
<fC03 i1="16" i2="X" l="ENG"><s0>Contraction</s0>
<s5>29</s5>
</fC03>
<fC03 i1="16" i2="X" l="SPA"><s0>Contracción</s0>
<s5>29</s5>
</fC03>
<fC03 i1="17" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC07 i1="01" i2="X" l="FRE"><s0>Aculeata</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="01" i2="X" l="ENG"><s0>Aculeata</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="01" i2="X" l="SPA"><s0>Aculeata</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="02" i2="X" l="FRE"><s0>Hymenoptera</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="02" i2="X" l="ENG"><s0>Hymenoptera</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="02" i2="X" l="SPA"><s0>Hymenoptera</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="03" i2="X" l="FRE"><s0>Insecta</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="03" i2="X" l="ENG"><s0>Insecta</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="03" i2="X" l="SPA"><s0>Insecta</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="04" i2="X" l="FRE"><s0>Arthropoda</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="04" i2="X" l="ENG"><s0>Arthropoda</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="04" i2="X" l="SPA"><s0>Arthropoda</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="05" i2="X" l="FRE"><s0>Invertebrata</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="05" i2="X" l="ENG"><s0>Invertebrata</s0>
<s2>NS</s2>
</fC07>
<fC07 i1="05" i2="X" l="SPA"><s0>Invertebrata</s0>
<s2>NS</s2>
</fC07>
<fN21><s1>022</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000739 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000739 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Curation |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. | ![]() |