Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Ivan Gavran"'
Autor:
Davorin Kajba, Ivan Andrić, Ivan Gavran, Tin Tomić, Ivana Plišo Vusić, Željko Zečić, Dinko Vusić
Publikováno v:
Croatian Journal of Forest Engineering, Vol 40, Iss 2, Pp 231-238 (2019)
The goal of the research was to determine the biomass yield and fuel properties of ten different poplar clones. The research was conducted in an experimental plot established in Forest Administration Osijek, Forest Office Darda, in the spring of 2014
Externí odkaz:
https://doaj.org/article/c315a8b2b6c5483bbbd3a44a97fcba8c
Autor:
Roel Schipper, Peter Eigenraam, Matteo Soru, Steffen Grünewald, Ivan Gavran, Mattias Michel, Arno Pronk, Dick Erinkveld, Hisham El Ghazi, Mitchell Janmaat, Tobi Lusing, Erwin van Rijbroek, Niek Schuijers, Martijn Verboord, Robin Versteeg
Publikováno v:
Spool, Vol 1, Iss 2 (2014)
The Kine-Mould is a development that makes it easier to manufacture building elements with complex geometry. Since June 2014 the team has been working on a range of solutions and prototypes. Various building materials have been investigated such as c
Externí odkaz:
https://doaj.org/article/463950920e2c4bd2842deb5a24ba251f
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:6429-6436
Reward machines are an established tool for dealing with reinforcement learning problems in which rewards are sparse and depend on complex sequences of actions. However, existing algorithms for learning reward machines assume an overly idealized sett
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cc749772995c3e69517a541ff323b4d
https://doi.org/10.1609/aaai.v36i6.20594
https://doi.org/10.1609/aaai.v36i6.20594
Publikováno v:
Proceedings of the ACM on Programming Languages
Motivated by applications in robotics, we consider the task of synthesizing linear temporal logic (LTL) specifications based on examples and natural language descriptions. While LTL is a flexible, expressive, and unambiguous language to describe robo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa1d8568b3dea8403201207a6233d701
https://doi.org/10.1145/3428269
https://doi.org/10.1145/3428269
Publikováno v:
AAAI Technical Track on Search and Optimization
The need to replan arises in many applications. However, in the context of planning as heuristic search, it raises an annoying problem: if the previous plan is still executing, what should the new plan search take as its initial state? If it were pos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::045d9ae3ec843f8131fe1f0be8b1d9a0
https://hdl.handle.net/21.11116/0000-0009-54CD-2
https://hdl.handle.net/21.11116/0000-0009-54CD-2
Publikováno v:
CPP '21
CPP
CPP
Proof engineering efforts using interactive theorem proving have yielded several impressive projects in software systems and mathematics. A key obstacle to such efforts is the requirement that the domain expert is also an expert in the low-level deta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c7f676fb7942d67075a829d7132dc99
https://hdl.handle.net/21.11116/0000-0009-0FE4-621.11116/0000-0009-0FE6-4
https://hdl.handle.net/21.11116/0000-0009-0FE4-621.11116/0000-0009-0FE6-4
Publikováno v:
AAAI Technical Track on Machine Learning III
We study a class of reinforcement learning tasks in which the agent receives its reward for complex, temporally-extended behaviors sparsely. For such tasks, the problem is how to augment the state-space so as to make the reward function Markovian in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f58a47fd63c6ef0c71ae1fda02ec0c11
https://hdl.handle.net/21.11116/0000-0009-559C-8
https://hdl.handle.net/21.11116/0000-0009-559C-8
Publikováno v:
ACM Transactions on Embedded Computing Systems. 16:1-19
We present Antlab, an end-to-end system that takes streams of user task requests and executes them using collections of robots. In Antlab, each request is specified declaratively in linear temporal logic extended with quantifiers over robots. The use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93e648652100d146db72b8cb689e0fbf
https://doi.org/10.1145/3126513
https://doi.org/10.1145/3126513
Autor:
Ivan Gavran, Ivan Andrić, Ivana Plišo Vusić, Dinko Vusić, Tin Tomić, Željko Zečić, Davorin Kajba
Publikováno v:
Croatian Journal of Forest Engineering : Journal for Theory and Application of Forestry Engineering
Volume 40
Issue 2
Croatian Journal of Forest Engineering, Vol 40, Iss 2, Pp 231-238 (2019)
Volume 40
Issue 2
Croatian Journal of Forest Engineering, Vol 40, Iss 2, Pp 231-238 (2019)
The goal of the research was to determine the biomass yield and fuel properties of ten different poplar clones. The research was conducted in an experimental plot established in Forest Administration Osijek, Forest Office Darda, in the spring of 2014
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1acd30bbfc50547246b25b1b8764a9c
https://doi.org/10.5552/crojfe.2019.678
https://doi.org/10.5552/crojfe.2019.678
Publikováno v:
Onward!
We present an expressive, concise, and extendable domain specific language for planning of assembly systems, such as industrial human robot cooperation. Increased flexibility requirements in manufacturing processes call for more automation at the des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f03213204da554fe36d33433dd6c5fb
https://doi.org/10.1145/3276954.3276961
https://doi.org/10.1145/3276954.3276961