{"id":"https://openalex.org/W2403069916","doi":null,"title":"Logic-geometric programming: an optimization-based approach to combined task and motion planning","display_name":"Logic-geometric programming: an optimization-based approach to combined task and motion planning","alternate_titles":[],"publication_year":2015,"publication_date":"2015-07-25","ids":{"openalex":"https://openalex.org/W2403069916","mag":"2403069916"},"language":"en","primary_location":{"id":"mag:2403069916","doi":null,"is_oa":false,"landing_page_url":"http://ipvs.informatik.uni-stuttgart.de/mlr/papers/15-toussaint-IJCAI.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2403069916"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065672819","display_name":"Marc Toussaint","orcid":"https://orcid.org/0000-0002-5487-6767","observed_orcids":["https://orcid.org/0000-0002-5487-6767"]},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Marc Toussaint","raw_affiliation_strings":["Machine Learning & Robotics Lab, University Stuttgart, Germany#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5487-6767","affiliations":[{"raw_affiliation_string":"Machine Learning & Robotics Lab, University Stuttgart, Germany#TAB#","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065672819"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":7.5646,"has_fulltext":false,"cited_by_count":383,"citation_normalized_percentile":{"value":0.97394239,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1930","last_page":"1936"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.4772999882698059,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.4772999882698059,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.30320000648498535,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.1581999957561493,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robotic-manipulation","display_name":"robotic manipulation","score":0.7990000247955322},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.7419999837875366},{"id":"https://openalex.org/keywords/block-stacking","display_name":"block stacking","score":0.4000000059604645}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6432338356971741},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6279534101486206},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5582714676856995},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5402341485023499},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5274569988250732},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5254982113838196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5112321376800537},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4702143967151642},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.46164005994796753},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.45734143257141113},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43985942006111145},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.43508845567703247},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39629656076431274},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35688018798828125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2788451611995697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24672207236289978},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.23276612162590027},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2403069916","doi":null,"is_oa":false,"landing_page_url":"http://ipvs.informatik.uni-stuttgart.de/mlr/papers/15-toussaint-IJCAI.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W42144691","https://openalex.org/W106094172","https://openalex.org/W160670953","https://openalex.org/W1419457303","https://openalex.org/W1852202999","https://openalex.org/W1867198697","https://openalex.org/W1985473518","https://openalex.org/W2031738727","https://openalex.org/W2044995998","https://openalex.org/W2050718309","https://openalex.org/W2057408106","https://openalex.org/W2101340954","https://openalex.org/W2102209023","https://openalex.org/W2131202188","https://openalex.org/W2132467020","https://openalex.org/W2134304017","https://openalex.org/W2135319191","https://openalex.org/W2141841102","https://openalex.org/W2161697934"],"related_works":["https://openalex.org/W2739341730","https://openalex.org/W2966193718","https://openalex.org/W4312337612","https://openalex.org/W1538491097","https://openalex.org/W2294295832","https://openalex.org/W2143602574","https://openalex.org/W2383103400","https://openalex.org/W4401414279","https://openalex.org/W3205467518","https://openalex.org/W639427803"],"abstract_inverted_index":{"We":[0,51,86,154],"consider":[1],"problems":[2],"of":[3,21,64,90,98,106,161,165,173],"sequential":[4],"robot":[5],"manipulation":[6],"(aka.":[7],"combined":[8],"task":[9],"and":[10,132,145,176],"motion":[11],"planning)":[12],"where":[13,77],"the":[14,26,55,73,78,83,88,104,107,148,156,163],"objective":[15],"is":[16,130],"primarily":[17],"given":[18,122],"in":[19],"terms":[20],"a":[22,32,59,65,68,121,159,166],"cost":[23],"function":[24],"over":[25,47,72,142,147],"final":[27],"geometric":[28],"state,":[29],"rather":[30],"than":[31],"symbolic":[33,79,123,135],"goal":[34],"description.":[35],"In":[36],"this":[37,128],"case":[38],"we":[39],"should":[40],"leverage":[41],"optimization":[42],"methods":[43],"to":[44,53,120],"inform":[45,134],"search":[46],"potential":[48],"action":[49,124],"sequences.":[50],"propose":[52],"formulate":[54],"problem":[56,160],"holistically":[57],"as":[58],"1st-":[60],"order":[61],"logic":[62],"extension":[63],"mathematical":[66],"program:":[67],"non-linear":[69],"constrained":[70],"program":[71],"full":[74,149],"world":[75,150],"trajectory":[76,151],"state-action":[80],"sequence":[81],"defines":[82],"(in-)equality":[84],"constraints.":[85],"tackle":[87],"challenge":[89],"solving":[91],"such":[92],"programs":[93],"by":[94],"proposing":[95],"three":[96],"levels":[97,140],"approximation:":[99],"The":[100,137],"coarsest":[101],"level":[102,129],"introduces":[103],"concept":[105],"effective":[108],"end":[109,116],"state":[110,117],"kinematics,":[111],"parametrically":[112],"describing":[113],"all":[114],"possible":[115],"configurations":[118],"conditional":[119],"sequence.":[125],"Optimization":[126],"on":[127,158],"fast":[131],"can":[133],"search.":[136],"other":[138],"two":[139],"optimize":[141],"interaction":[143],"keyframes":[144],"eventually":[146],"across":[152],"interactions.":[153],"demonstrate":[155],"approach":[157],"maximizing":[162],"height":[164],"physically":[167],"stable":[168],"construction":[169],"from":[170],"an":[171],"assortment":[172],"boards,":[174],"cylinders":[175],"blocks.":[177]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2403069916","counts_by_year":[{"year":2026,"cited_by_count":55},{"year":2025,"cited_by_count":55},{"year":2024,"cited_by_count":42},{"year":2023,"cited_by_count":50},{"year":2022,"cited_by_count":52},{"year":2021,"cited_by_count":37},{"year":2020,"cited_by_count":31},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
