Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/amai/amai31.bht:"
@article{DBLP:journals/amai/Choset01, author = {Howie Choset}, title = {Coverage for robotics - {A} survey of recent results}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {113--126}, year = {2001}, url = {https://doi.org/10.1023/A:1016639210559}, doi = {10.1023/A:1016639210559}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/Choset01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/GabrielyR01, author = {Yoav Gabriely and Elon Rimon}, title = {Spanning-tree based coverage of continuous areas by a mobile robot}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {77--98}, year = {2001}, url = {https://doi.org/10.1023/A:1016610507833}, doi = {10.1023/A:1016610507833}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amai/GabrielyR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/HirshG01, author = {Aaron E. Hirsh and Deborah M. Gordon}, title = {Distributed problem solving in social insects}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {199--221}, year = {2001}, url = {https://doi.org/10.1023/A:1016651613285}, doi = {10.1023/A:1016651613285}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/HirshG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/KoenigSL01, author = {Sven Koenig and Boleslaw K. Szymanski and Yaxin Liu}, title = {Efficient and inefficient ant coverage methods}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {41--76}, year = {2001}, url = {https://doi.org/10.1023/A:1016665115585}, doi = {10.1023/A:1016665115585}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amai/KoenigSL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/RekleitisDM01, author = {Ioannis M. Rekleitis and Gregory Dudek and Evangelos E. Milios}, title = {Multi-robot collaboration for robust exploration}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {7--40}, year = {2001}, url = {https://doi.org/10.1023/A:1016636024246}, doi = {10.1023/A:1016636024246}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/RekleitisDM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/Richardson01, author = {Tom J. Richardson}, title = {Non-mutual captures in cyclic pursuit}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {127--146}, year = {2001}, url = {https://doi.org/10.1023/A:1016670220800}, doi = {10.1023/A:1016670220800}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/Richardson01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/Richardson01a, author = {Tom J. Richardson}, title = {Stable polygons of cyclic pursuit}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {147--172}, year = {2001}, url = {https://doi.org/10.1023/A:1016678406688}, doi = {10.1023/A:1016678406688}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/Richardson01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/SchutterTD01, author = {Geoffroy De Schutter and Guy Theraulaz and Jean{-}Louis Deneubourg}, title = {Animal-robots collective intelligence}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {223--238}, year = {2001}, url = {https://doi.org/10.1023/A:1016638723526}, doi = {10.1023/A:1016638723526}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/SchutterTD01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/WagnerB01, author = {Israel A. Wagner and Alfred M. Bruckstein}, title = {From Ants to A(ge)nts: {A} Special Issue on Ant-Robotics}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {1--5}, year = {2001}, url = {https://doi.org/10.1023/A:1016666118983}, doi = {10.1023/A:1016666118983}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/WagnerB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/WergerM01, author = {Barry Brian Werger and Maja J. Mataric}, title = {From insect to Internet: Situated control for networked robot teams}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {173--197}, year = {2001}, url = {https://doi.org/10.1023/A:1016650101473}, doi = {10.1023/A:1016650101473}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amai/WergerM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/YanovskiWB01, author = {Vladimir Yanovski and Israel A. Wagner and Alfred M. Bruckstein}, title = {Vertex-Ant-Walk - {A} robust method for efficient exploration of faulty graphs}, journal = {Ann. Math. Artif. Intell.}, volume = {31}, number = {1-4}, pages = {99--112}, year = {2001}, url = {https://doi.org/10.1023/A:1016688707365}, doi = {10.1023/A:1016688707365}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/YanovskiWB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.