LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1

Discovery Projects - Grant ID: DP140104219

Title
Discovery Projects - Grant ID: DP140104219
Funding
ARC | Discovery Projects
Contract (GA) number
DP140104219
Start Date
2014/01/01
End Date
2016/12/31
Open Access mandate
no
Organizations
-
More information
http://purl.org/au-research/grants/arc/DP140104219

 

  • Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices

    Bogomolov, Sergiy; Forets, Marcelo; Frehse, Goran; Podelski, Andreas; Schilling, Christian; Viry, Frédéric (2018)
    Projects: ARC | Discovery Projects - Grant ID: DP140104219 (DP140104219)
    Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical systems, available algorithms still lack scalability to ensure their wide adoption in the industrial setting. While modern linear algebra packages are efficient for matrices with tens of thousands of dimensions, set-based image computations are limited to a f...

    Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains

    Ramirez, Miquel; Scala, Enrico; Haslum, Patrik; Thiebaux, Sylvie (2017)
    Projects: ARC | Discovery Projects - Grant ID: DP140104219 (DP140104219)
    In this paper we look into the problem of planning over hybrid domains, where change can be both discrete and instantaneous, or continuous over time. In addition, it is required that each state on the trajectory induced by the execution of plans complies with a given set of global constraints. We approach the computation of plans for such domains as the problem of searching over a deterministic state model. In this model, some of the successor states are obtained by solving numerically the so...
  • No project research data found
  • Scientific Results

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    PUBLICATIONS BY ACCESS MODE

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Publications in Repositories

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark

App Box