- home
- Advanced Search
- EDIH Adria
- 2013-2022
- Open Access
- Publications
- Research software
- Other research products
- European Commission
- EU
- ELTE Digital Institutional Reposito...
- EDIH Adria
- 2013-2022
- Open Access
- Publications
- Research software
- Other research products
- European Commission
- EU
- ELTE Digital Institutional Reposito...
Loading
description Publicationkeyboard_double_arrow_right Article , Other literature type , Part of book or chapter of book , Preprint 2016 Hungary, SwitzerlandPublisher:Springer Berlin Heidelberg Funded by:EC | CovDecRNDEC| CovDecRNDAuthors: Pach, János; Pálvölgyi, Dömötör;Pach, János; Pálvölgyi, Dömötör;A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings was motivated by classical density estimates for {\em sphere packings} as well as by the {\em planar sensor cover problem}. It has been the prevailing conjecture for 35 years (settled in many special cases) that for every plane convex body $C$, there exists a constant $m=m(C)$ such that every $m$-fold covering of the plane with translates of $C$ splits into $2$ coverings. In the present paper, it is proved that this conjecture is false for the unit disk. The proof can be generalized to construct, for every $m$, an unsplittable $m$-fold covering of the plane with translates of any open convex body $C$ which has a smooth boundary with everywhere {\em positive curvature}. Somewhat surprisingly, {\em unbounded} open convex sets $C$ do not misbehave, they satisfy the conjecture: every $3$-fold covering of any region of the plane by translates of such a set $C$ splits into two coverings. To establish this result, we prove a general coloring theorem for hypergraphs of a special type: {\em shift-chains}. We also show that there is a constant $c>0$ such that, for any positive integer $m$, every $m$-fold covering of a region with unit disks splits into two coverings, provided that every point is covered by {\em at most} $c2^{m/2}$ sets.
ELTE Digital Institu... arrow_drop_down Advances in MathematicsOther literature type . Article . 2016 . Peer-reviewedLicense: Elsevier Non-CommercialInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationsInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationshttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2016 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-662-53174-7_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen hybrid 10 citations 10 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down Advances in MathematicsOther literature type . Article . 2016 . Peer-reviewedLicense: Elsevier Non-CommercialInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationsInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationshttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2016 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-662-53174-7_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2015 Hungary, BrazilPublisher:Springer Science and Business Media LLC Funded by:UKRI | SUNRISE (Synthomer UCL Ne..., EC | REGULARITYUKRI| SUNRISE (Synthomer UCL Nexeon Rapid Improvement in the Storage of Energy) ,EC| REGULARITYAuthors: Keleti, Tamás; Matolcsi, Máté; Filho, Fernando Mário de Oliveira; Ruzsa, Imre Z.;Keleti, Tamás; Matolcsi, Máté; Filho, Fernando Mário de Oliveira; Ruzsa, Imre Z.;handle: 10831/48772
A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two results. First, we show that any $1$-avoiding set in $\mathbb{R}^n$ ($n\ge 2$) that displays block structure (i.e., is made up of blocks such that the distance between any two points from the same block is less than $1$ and points from distinct blocks lie farther than $1$ unit of distance apart from each other) has density strictly less than $1/2^n$. For the special case of sets with block structure this proves a conjecture of Erd\H{o}s asserting that $m_1(\mathbb{R}^2) < 1/4$. Second, we use linear programming and harmonic analysis to show that $m_1(\mathbb{R}^2) \leq 0.258795$. Comment: 16 pages, 1 figure. Contains a Sage script called dstverify.sage, to verify the application of Theorem 3.3. Download the article source to get the script
ELTE Digital Institu... arrow_drop_down Discrete & Computational Geometry; Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual) - Universidade de São Paulo (USP)Article . 2015 . 2016 . Peer-reviewedLicense: Springer TDMhttps://doi.org/10.48550/arxiv...Article . 2015License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/s00454-015-9751-5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 5 citations 5 popularity Average influence Average impulse Average Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down Discrete & Computational Geometry; Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual) - Universidade de São Paulo (USP)Article . 2015 . 2016 . Peer-reviewedLicense: Springer TDMhttps://doi.org/10.48550/arxiv...Article . 2015License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/s00454-015-9751-5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article 2015 HungaryPublisher:Walter de Gruyter GmbH Funded by:EC | ACOMINEC| ACOMINAuthors: László, Z Varga;László, Z Varga;handle: 10831/66108
Abstract The online routing game model can be used to measure and prove the benefits of online real time data in road traffic navigation systems. A few properties of the routing strategies are already proved. In this paper we point out that there are some paradoxes like phenomena behind these proofs, similarly as in the Braess network.
ELTE Digital Institu... arrow_drop_down ELTE Digital Institutional Repository (EDIT)Article . 2015Data sources: ELTE Digital Institutional Repository (EDIT)Cybernetics and Information TechnologiesArticle . 2015 . Peer-reviewedLicense: CC BY NC NDData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1515/cait-2015-0018&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen gold 4 citations 4 popularity Average influence Average impulse Average Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down ELTE Digital Institutional Repository (EDIT)Article . 2015Data sources: ELTE Digital Institutional Repository (EDIT)Cybernetics and Information TechnologiesArticle . 2015 . Peer-reviewedLicense: CC BY NC NDData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1515/cait-2015-0018&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint 2014 HungaryPublisher:IOP Publishing Funded by:EC | COLLMOTEC| COLLMOTVirágh, C; Tarcai, N; Szörényi, T; Somorjai, G; Nepusz, T; Vicsek, T; Vásárhelyi, Gábor;Animal swarms displaying a variety of typical flocking patterns would not exist without the underlying safe, optimal and stable dynamics of the individuals. The emergence of these universal patterns can be efficiently reconstructed with agent-based models. If we want to reproduce these patterns with artificial systems, such as autonomous aerial robots, agent-based models can also be used in their control algorithms. However, finding the proper algorithms and thus understanding the essential characteristics of the emergent collective behaviour requires thorough and realistic modeling of the robot and also the environment. In this paper, we first present an abstract mathematical model of an autonomous flying robot. The model takes into account several realistic features, such as time delay and locality of communication, inaccuracy of the on-board sensors and inertial effects. We present two decentralized control algorithms. One is based on a simple self-propelled flocking model of animal collective motion, the other is a collective target tracking algorithm. Both algorithms contain a viscous friction-like term, which aligns the velocities of neighbouring agents parallel to each other. We show that this term can be essential for reducing the inherent instabilities of such a noisy and delayed realistic system. We discuss simulation results on the stability of the control algorithms, and perform real experiments to show the applicability of the algorithms on a group of autonomous quadcopters. In our case, bio-inspiration works in two ways. On the one hand, the whole idea of trying to build and control a swarm of robots comes from the observation that birds tend to flock to optimize their behaviour as a group. On the other hand, by using a realistic simulation framework and studying the group behaviour of autonomous robots we can learn about the major factors influencing the flight of bird flocks. © 2014 IOP Publishing Ltd.
ELTE Digital Institu... arrow_drop_down Bioinspiration & BiomimeticsArticle . 2014 . Peer-reviewedLicense: IOP Copyright PoliciesData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Datacitehttps://doi.org/http://dx.doi....Article . Peer-reviewedData sources: European Union Open Data Portaladd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1088/1748-3182/9/2/025012&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 139 citations 139 popularity Top 1% influence Top 1% impulse Top 1% Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down Bioinspiration & BiomimeticsArticle . 2014 . Peer-reviewedLicense: IOP Copyright PoliciesData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Datacitehttps://doi.org/http://dx.doi....Article . Peer-reviewedData sources: European Union Open Data Portaladd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1088/1748-3182/9/2/025012&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Article , Other literature type , Part of book or chapter of book , Preprint 2016 Hungary, SwitzerlandPublisher:Springer Berlin Heidelberg Funded by:EC | CovDecRNDEC| CovDecRNDAuthors: Pach, János; Pálvölgyi, Dömötör;Pach, János; Pálvölgyi, Dömötör;A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings was motivated by classical density estimates for {\em sphere packings} as well as by the {\em planar sensor cover problem}. It has been the prevailing conjecture for 35 years (settled in many special cases) that for every plane convex body $C$, there exists a constant $m=m(C)$ such that every $m$-fold covering of the plane with translates of $C$ splits into $2$ coverings. In the present paper, it is proved that this conjecture is false for the unit disk. The proof can be generalized to construct, for every $m$, an unsplittable $m$-fold covering of the plane with translates of any open convex body $C$ which has a smooth boundary with everywhere {\em positive curvature}. Somewhat surprisingly, {\em unbounded} open convex sets $C$ do not misbehave, they satisfy the conjecture: every $3$-fold covering of any region of the plane by translates of such a set $C$ splits into two coverings. To establish this result, we prove a general coloring theorem for hypergraphs of a special type: {\em shift-chains}. We also show that there is a constant $c>0$ such that, for any positive integer $m$, every $m$-fold covering of a region with unit disks splits into two coverings, provided that every point is covered by {\em at most} $c2^{m/2}$ sets.
ELTE Digital Institu... arrow_drop_down Advances in MathematicsOther literature type . Article . 2016 . Peer-reviewedLicense: Elsevier Non-CommercialInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationsInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationshttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2016 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-662-53174-7_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen hybrid 10 citations 10 popularity Top 10% influence Average impulse Average Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down Advances in MathematicsOther literature type . Article . 2016 . Peer-reviewedLicense: Elsevier Non-CommercialInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationsInfoscience - EPFL scientific publicationsOther literature typeData sources: Infoscience - EPFL scientific publicationshttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2016 . Peer-reviewedLicense: Springer TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-662-53174-7_20&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2015 Hungary, BrazilPublisher:Springer Science and Business Media LLC Funded by:UKRI | SUNRISE (Synthomer UCL Ne..., EC | REGULARITYUKRI| SUNRISE (Synthomer UCL Nexeon Rapid Improvement in the Storage of Energy) ,EC| REGULARITYAuthors: Keleti, Tamás; Matolcsi, Máté; Filho, Fernando Mário de Oliveira; Ruzsa, Imre Z.;Keleti, Tamás; Matolcsi, Máté; Filho, Fernando Mário de Oliveira; Ruzsa, Imre Z.;handle: 10831/48772
A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two results. First, we show that any $1$-avoiding set in $\mathbb{R}^n$ ($n\ge 2$) that displays block structure (i.e., is made up of blocks such that the distance between any two points from the same block is less than $1$ and points from distinct blocks lie farther than $1$ unit of distance apart from each other) has density strictly less than $1/2^n$. For the special case of sets with block structure this proves a conjecture of Erd\H{o}s asserting that $m_1(\mathbb{R}^2) < 1/4$. Second, we use linear programming and harmonic analysis to show that $m_1(\mathbb{R}^2) \leq 0.258795$. Comment: 16 pages, 1 figure. Contains a Sage script called dstverify.sage, to verify the application of Theorem 3.3. Download the article source to get the script
ELTE Digital Institu... arrow_drop_down Discrete & Computational Geometry; Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual) - Universidade de São Paulo (USP)Article . 2015 . 2016 . Peer-reviewedLicense: Springer TDMhttps://doi.org/10.48550/arxiv...Article . 2015License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/s00454-015-9751-5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 5 citations 5 popularity Average influence Average impulse Average Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down Discrete & Computational Geometry; Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual) - Universidade de São Paulo (USP)Article . 2015 . 2016 . Peer-reviewedLicense: Springer TDMhttps://doi.org/10.48550/arxiv...Article . 2015License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/s00454-015-9751-5&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article 2015 HungaryPublisher:Walter de Gruyter GmbH Funded by:EC | ACOMINEC| ACOMINAuthors: László, Z Varga;László, Z Varga;handle: 10831/66108
Abstract The online routing game model can be used to measure and prove the benefits of online real time data in road traffic navigation systems. A few properties of the routing strategies are already proved. In this paper we point out that there are some paradoxes like phenomena behind these proofs, similarly as in the Braess network.
ELTE Digital Institu... arrow_drop_down ELTE Digital Institutional Repository (EDIT)Article . 2015Data sources: ELTE Digital Institutional Repository (EDIT)Cybernetics and Information TechnologiesArticle . 2015 . Peer-reviewedLicense: CC BY NC NDData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1515/cait-2015-0018&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen gold 4 citations 4 popularity Average influence Average impulse Average Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down ELTE Digital Institutional Repository (EDIT)Article . 2015Data sources: ELTE Digital Institutional Repository (EDIT)Cybernetics and Information TechnologiesArticle . 2015 . Peer-reviewedLicense: CC BY NC NDData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1515/cait-2015-0018&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint 2014 HungaryPublisher:IOP Publishing Funded by:EC | COLLMOTEC| COLLMOTVirágh, C; Tarcai, N; Szörényi, T; Somorjai, G; Nepusz, T; Vicsek, T; Vásárhelyi, Gábor;Animal swarms displaying a variety of typical flocking patterns would not exist without the underlying safe, optimal and stable dynamics of the individuals. The emergence of these universal patterns can be efficiently reconstructed with agent-based models. If we want to reproduce these patterns with artificial systems, such as autonomous aerial robots, agent-based models can also be used in their control algorithms. However, finding the proper algorithms and thus understanding the essential characteristics of the emergent collective behaviour requires thorough and realistic modeling of the robot and also the environment. In this paper, we first present an abstract mathematical model of an autonomous flying robot. The model takes into account several realistic features, such as time delay and locality of communication, inaccuracy of the on-board sensors and inertial effects. We present two decentralized control algorithms. One is based on a simple self-propelled flocking model of animal collective motion, the other is a collective target tracking algorithm. Both algorithms contain a viscous friction-like term, which aligns the velocities of neighbouring agents parallel to each other. We show that this term can be essential for reducing the inherent instabilities of such a noisy and delayed realistic system. We discuss simulation results on the stability of the control algorithms, and perform real experiments to show the applicability of the algorithms on a group of autonomous quadcopters. In our case, bio-inspiration works in two ways. On the one hand, the whole idea of trying to build and control a swarm of robots comes from the observation that birds tend to flock to optimize their behaviour as a group. On the other hand, by using a realistic simulation framework and studying the group behaviour of autonomous robots we can learn about the major factors influencing the flight of bird flocks. © 2014 IOP Publishing Ltd.
ELTE Digital Institu... arrow_drop_down Bioinspiration & BiomimeticsArticle . 2014 . Peer-reviewedLicense: IOP Copyright PoliciesData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Datacitehttps://doi.org/http://dx.doi....Article . Peer-reviewedData sources: European Union Open Data Portaladd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1088/1748-3182/9/2/025012&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 139 citations 139 popularity Top 1% influence Top 1% impulse Top 1% Powered by BIP!more_vert ELTE Digital Institu... arrow_drop_down Bioinspiration & BiomimeticsArticle . 2014 . Peer-reviewedLicense: IOP Copyright PoliciesData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2013License: arXiv Non-Exclusive DistributionData sources: Datacitehttps://doi.org/http://dx.doi....Article . Peer-reviewedData sources: European Union Open Data Portaladd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1088/1748-3182/9/2/025012&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu