Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Iyad Kanj"'
Autor:
Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Umer Huzaifa, Iyad Kanj, Isuru S. Godage
Publikováno v:
IEEE Access, Vol 11, Pp 63136-63148 (2023)
Soft robots have emerged as a novel approach to legged locomotion, demonstrating strong potential for navigating unstructured terrains. The omnidirectional bending capability of soft robotic limbs allows for a diverse range of locomotion gaits to be
Externí odkaz:
https://doaj.org/article/4055ba8d87ce4a969648bc1e4d037b10
Publikováno v:
IEEE Robot Autom Lett
Continuum arms are bio-inspired devices that exhibit continuous, smooth bending and generate motion through structural deformation. Rapidly-exploring random trees (RRT) is a traditional approach for performing efficient path planning. RRT approaches
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b13c0e60b05508142efcd0910e50bce
https://doi.org/10.1109/lra.2022.3174257
https://doi.org/10.1109/lra.2022.3174257
Based on well-known complexity theory conjectures, any polynomial-time kernelization algorithm for the NP-hard Line-Cover problem produces a kernel of size Ω(k2), where k is the size of the sought line cover. Motivated by the current research in ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::579ab6c93d00e04775185d3091449920
https://doi.org/10.21203/rs.3.rs-2515139/v1
https://doi.org/10.21203/rs.3.rs-2515139/v1
Publikováno v:
2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bac749f2a95b29d72b3b1d3cd844ee17
https://doi.org/10.1109/hipc56025.2022.00046
https://doi.org/10.1109/hipc56025.2022.00046
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::098b48b799c4d1e256e11d4b4134316f
https://doi.org/10.2139/ssrn.4264146
https://doi.org/10.2139/ssrn.4264146
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 32
Given a set of obstacles and two designated points in the plane, the Minimum Constraint Removal problem asks for a minimum number of obstacles that can be removed so that a collision-free path exists between the two designated points. It is a well-st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfcbc6f9ebbc6d1b94455fd2aab67bee
https://doi.org/10.1609/aaai.v32i1.12100
https://doi.org/10.1609/aaai.v32i1.12100
Autor:
Iyad Kanj, Stefan Szeider
A Constraint Satisfaction Problem (CSP) with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper bound can be improved for certain na
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::869c39af7a0ec8b7550c8f374e5e54a4
http://arxiv.org/abs/1304.1996
http://arxiv.org/abs/1304.1996
Publikováno v:
Algorithmica; Jun2008, Vol. 51 Issue 2, p99-128, 30p
Publikováno v:
Journal of Combinatorial Optimization; Mar2006, Vol. 11 Issue 2, p231-247, 17p