2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2016
DOI: 10.1109/iros.2016.7759740
|View full text |Cite
|
Sign up to set email alerts
|

Sequential quadratic programming for task plan optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(25 citation statements)
references
References 9 publications
0
25
0
Order By: Relevance
“…Therefore, this approach may have difficulty when the solution space is relatively small since the probability of being able to sample the correct solution is small. In contrast, the optimization-based approach used optimization techniques such as logic-geometric programming ( Toussaint et al., 2018 ) or sequential quadratic programming ( Hadfield-Menell et al., 2016 ). It is able to handle problems with a small solution space more efficiently if the local optima can be handled properly.…”
Section: Robot Tool Use Literaturementioning
confidence: 99%
“…Therefore, this approach may have difficulty when the solution space is relatively small since the probability of being able to sample the correct solution is small. In contrast, the optimization-based approach used optimization techniques such as logic-geometric programming ( Toussaint et al., 2018 ) or sequential quadratic programming ( Hadfield-Menell et al., 2016 ). It is able to handle problems with a small solution space more efficiently if the local optima can be handled properly.…”
Section: Robot Tool Use Literaturementioning
confidence: 99%
“…For systems without access to a GPU or other neural network accelerator, it may be fruitful to explore other routes to compute a warm-start trajectory, e.g., different/smaller network design, or a nearest trajectory from the training dataset (42). There may be potential for using a deep learning-based warm start to speed up constrained optimizations in other fields of robotics, e.g., grasp contact models (43), task planning (44,45), and model predictive control (46,47)-potentially allowing such algorithms to run at interactive rates and enabling new applications.…”
Section: Opportunities For Future Researchmentioning
confidence: 99%
“…The robotics community, on the other hand, has recently shown interest in combined Task and Motion Planning (TAMP) (Srivastava et al 2014;Lozano-Pérez and Kaelbling 2014). Like our planner, some interesting approaches combine optimization with discrete search (Toussaint 2015;Hadfield-Menell et al 2016). These planners excel at highly constrained manipulation problems but do not scale to long planning horizons due to time discretization.…”
Section: Related Workmentioning
confidence: 99%