Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Gal A. Kaminka"'
Autor:
Amir Ayali, Gal A. Kaminka
Publikováno v:
Frontiers in Neurorobotics, Vol 17 (2023)
Swarming or collective motion is ubiquitous in natural systems, and instrumental in many technological applications. Accordingly, research interest in this phenomenon is crossing discipline boundaries. A common major question is that of the intricate
Externí odkaz:
https://doaj.org/article/5ca7ae13ba1041e4b45ee57537b47036
Autor:
Shify Treger, Gal A. Kaminka
Publikováno v:
Frontiers in Artificial Intelligence, Vol 4 (2022)
Recently, we are seeing the emergence of plan- and goal-recognition algorithms which are based on the principle of rationality. These avoid the use of a plan library that compactly encodes all possible observable plans, and instead generate plans dyn
Externí odkaz:
https://doaj.org/article/21b157961af2448b972e896d1fa11c52
Publikováno v:
PLoS Computational Biology, Vol 20, Iss 1, p e1011796 (2024)
Naturally occurring collective motion is a fascinating phenomenon in which swarming individuals aggregate and coordinate their motion. Many theoretical models of swarming assume idealized, perfect perceptual capabilities, and ignore the underlying pe
Externí odkaz:
https://doaj.org/article/764762b310114872a49a910bfaecf29f
Collective motion is an omnipresent, fascinating phenomenon. Swarming individuals aggregate, coordinate and move, utilizing only local social cues projected by conspecifics in their vicinity. Major theoretical studies assumed perfect information avai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0216467763c3ee81e447216bd335f309
https://doi.org/10.1101/2023.01.17.524210
https://doi.org/10.1101/2023.01.17.524210
Pharmaceutical nanoparticles (NPs) carrying molecular payloads are used for medical purposes such as diagnosis and medical treatment. They are designed to modify the pharmacokinetics-pharmacodynamics (PKPD) of their associated payloads, to obtain bet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cc08d96c026352640e7eec78b469326
https://doi.org/10.1101/2022.07.12.499805
https://doi.org/10.1101/2022.07.12.499805
Pharmaceutical nanoparticles (NPs) carrying molecular payloads are used for medical purposes such as diagnosis and medical treatment. Currently, the research process of discovering a new applicative candidate for efficient clinical treatment is a tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6e6d9c5dd105bb669772ec6c2ca095b
https://doi.org/10.1101/2022.07.13.499855
https://doi.org/10.1101/2022.07.13.499855
Autor:
Gal A. Kaminka, Alon T. Zanbar
Publikováno v:
Artificial Intelligence Methods for Software Engineering
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34480558c35fa23d750ab24b8adcb6f8
https://doi.org/10.1142/9789811239922_0004
https://doi.org/10.1142/9789811239922_0004
Autor:
Natalie Fridman, Gal A. Kaminka
Publikováno v:
ACM Transactions on Intelligent Systems and Technology. 9:1-27
Models of crowd dynamics are critically important for urban planning and management. They support analysis, facilitate qualitative and quantitative predictions, and synthesize behaviors for simulations. One promising approach to crowd modeling relies
Publikováno v:
Distributed Autonomous Robotic Systems ISBN: 9783030058159
DARS
DARS
Coverage is a canonical task where a robot or a group of robots are required to visit every point in a given work area, typically within the shortest possible time. Previous work on offline coverage highlighted the benefits of determining a circular
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::718555da9f1ae14a311da0819c8ba25f
https://doi.org/10.1007/978-3-030-05816-6_28
https://doi.org/10.1007/978-3-030-05816-6_28
Publikováno v:
The International Journal of Robotics Research. 35:1419-1444
Coverage is a fundamental problem in robotics, where one or more robots are required to visit each point in a target area at least once. Most previous work has concentrated on finding a coverage path that would minimize the coverage time. In this pap