default search action
Ajay Sathya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Ajay Suresha Sathya, Wilm Decré, Jan Swevers:
PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix. IEEE Robotics Autom. Lett. 9(11): 10224-10231 (2024) - [j2]Ajay Suresha Sathya, Herman Bruyninckx, Wilm Decré, Goele Pipeleers:
Efficient Constrained Dynamics Algorithms Based on an Equivalent LQR Formulation Using Gauss' Principle of Least Constraint. IEEE Trans. Robotics 40: 729-749 (2024) - [i5]Ajay Suresha Sathya:
Constrained Dynamics Simulation: More With Less. CoRR abs/2405.20820 (2024) - 2023
- [c6]Lander Vanroye, Ajay Sathya, Joris De Schutter, Wilm Decré:
FATROP: A Fast Constrained Optimal Control Problem Solver for Robot Trajectory Optimization and Control. IROS 2023: 10036-10043 - [i4]Lander Vanroye, Ajay Sathya, Joris De Schutter, Wilm Decré:
FATROP : A Fast Constrained Optimal Control Problem Solver for Robot Trajectory Optimization and Control. CoRR abs/2303.16746 (2023) - [i3]Ajay Suresha Sathya, Herman Bruyninckx, Wilm Decré, Goele Pipeleers:
Efficient Constrained Dynamics Algorithms based on an Equivalent LQR Formulation using Gauss' Principle of Least Constraint. CoRR abs/2310.00688 (2023) - [i2]Ajay Suresha Sathya, Wilm Decré, Jan Swevers:
PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix. CoRR abs/2310.03676 (2023) - 2022
- [c5]Ajay Suresha Sathya, Wilm Decré, Goele Pipeleers, Jan Swevers:
A Simple Formulation for Fast Prioritized Optimal Control of Robots using Weighted Exact Penalty Functions. ICRA 2022: 5262-5269 - [c4]Ajay Suresha Sathya, Alejandro Astudillo, Joris Gillis, Wilm Decré, Goele Pipeleers, Jan Swevers:
Tasho: A Python Toolbox for Rapid Prototyping and Deployment of Optimal Control Problem-Based Complex Robot Motion Skills. IROS 2022: 9700-9707 - 2021
- [j1]Ajay Suresha Sathya, Goele Pipeleers, Wilm Decré, Jan Swevers:
A Weighted Method for Fast Resolution of Strictly Hierarchical Robot Task Specifications Using Exact Penalty Functions. IEEE Robotics Autom. Lett. 6(2): 3057-3064 (2021) - [c3]Vahid Mokhtari, Ajay Suresha Sathya, Nikolaos Tsiogkas, Wilm Decré:
Safe-Planner: A Single-Outcome Replanner for Computing Strong Cyclic Policies in Fully Observable Non-Deterministic Domains. ICAR 2021: 974-981 - [i1]Vahid Mokhtari, Ajay Suresha Sathya, Nikolaos Tsiogkas, Wilm Decré:
Safe-Planner: A Single-Outcome Replanner for Computing Strong Cyclic Policies in Fully Observable Non-Deterministic Domains. CoRR abs/2109.11471 (2021) - 2020
- [c2]Ajay Suresha Sathya, Joris Gillis, Goele Pipeleers, Jan Swevers:
Real-time Robot Arm Motion Planning and Control with Nonlinear Model Predictive Control using Augmented Lagrangian on a First-Order Solver. ECC 2020: 507-512
2010 – 2019
- 2018
- [c1]Ajay Sathya, Pantelis Sopasakis, Ruben Van Parys, Andreas Themelis, Goele Pipeleers, Panagiotis Patrinos:
Embedded nonlinear model predictive control for obstacle avoidance using PANOC. ECC 2018: 1523-1528
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint