Linear planning logic: An efficient language and theorem prover for robotic task planning

In this paper, we introduce a novel logic language and theorem prover for robotic task planning. Our language, which we call Linear Planning Logic (LPL), is a fragment of linear logic whose resource-conscious semantics are well suited for reasoning with dynamic state, while its structure admits effi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings - IEEE International Conference on Robotics and Automation s. 3764 - 3770
Hlavní autoři: Kortik, Sitar, Saranli, Uluc
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2014
Témata:
Cognition
Encoding
Legged locomotion
Planning
Rough surfaces
Surface roughness
ISSN:1050-4729
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, we introduce a novel logic language and theorem prover for robotic task planning. Our language, which we call Linear Planning Logic (LPL), is a fragment of linear logic whose resource-conscious semantics are well suited for reasoning with dynamic state, while its structure admits efficient theorem provers for automatic plan construction. LPL can be considered as an extension of Linear Hereditary Harrop Formulas (LHHF), whose careful design allows the minimization of nondeterminism in proof search, providing a sufficient basis for the design of linear logic programming languages such as Lolli. Our new language extends on the expressivity of LHHF, while keeping the resulting nondeterminism in proof search to a minimum for efficiency. This paper introduces the LPL language, presents the main ideas behind our theorem prover on a smaller fragment of this language and finally provides an experimental illustration of its operation on the problem of task planning for the hexapod robot RHex.
AbstractList In this paper, we introduce a novel logic language and theorem prover for robotic task planning. Our language, which we call Linear Planning Logic (LPL), is a fragment of linear logic whose resource-conscious semantics are well suited for reasoning with dynamic state, while its structure admits efficient theorem provers for automatic plan construction. LPL can be considered as an extension of Linear Hereditary Harrop Formulas (LHHF), whose careful design allows the minimization of nondeterminism in proof search, providing a sufficient basis for the design of linear logic programming languages such as Lolli. Our new language extends on the expressivity of LHHF, while keeping the resulting nondeterminism in proof search to a minimum for efficiency. This paper introduces the LPL language, presents the main ideas behind our theorem prover on a smaller fragment of this language and finally provides an experimental illustration of its operation on the problem of task planning for the hexapod robot RHex.
Author Saranli, Uluc
Kortik, Sitar
Author_xml – sequence: 1
  givenname: Sitar
  surname: Kortik
  fullname: Kortik, Sitar
  email: sitar@cs.bilkent.edu.tr
  organization: Dept. of Comput. Eng., Bilkent Univ., Ankara, Turkey
– sequence: 2
  givenname: Uluc
  surname: Saranli
  fullname: Saranli, Uluc
  email: saranli@ceng.metu.edu.tr
  organization: Dept. of Comput. Eng., Middle East Tech. Univ., Ankara, Turkey
BookMark eNo9kM1KxDAYACOs4Hb1AcRLXqA1aX7aeCvFn4WCILsHT0vSfKnRblLSKvj2Ci6e5jAwh8nQKsQACF1TUlBK1O22fWmKklBeSEUqTvgZyiivlGKyFmKF1pQIkvOqVBcom-d3QghjUq7Ra-cD6ISnUYfgw4DHOPj-DjcBg3O-9xAW_OuGTz0A1sHi5Q1igiOeUvyChF1MOEUTF9_jRc8f_6VLdO70OMPViRu0f7jftU959_y4bZsu9yWtl1xUlFtnpHJcOcF6Z7U0jBEmuOHGgi0B-tpAWUlWW-ooE0oBFwJqYY2ybINu_roeAA5T8kedvg-nDewHIbtUaw
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICRA.2014.6907404
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1479936855
9781479936854
EndPage 3770
ExternalDocumentID 6907404
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i218t-5714dfb69f49f53cfda6b330354b4bded2eec8be27638d1f13599e455e85db9d3
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000377221103116&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1050-4729
IngestDate Wed Aug 27 04:24:12 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i218t-5714dfb69f49f53cfda6b330354b4bded2eec8be27638d1f13599e455e85db9d3
OpenAccessLink https://hdl.handle.net/11511/38701
PageCount 7
ParticipantIDs ieee_primary_6907404
PublicationCentury 2000
PublicationDate 2014-May
PublicationDateYYYYMMDD 2014-05-01
PublicationDate_xml – month: 05
  year: 2014
  text: 2014-May
PublicationDecade 2010
PublicationTitle Proceedings - IEEE International Conference on Robotics and Automation
PublicationTitleAbbrev ICRA
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003366
Score 1.5615339
Snippet In this paper, we introduce a novel logic language and theorem prover for robotic task planning. Our language, which we call Linear Planning Logic (LPL), is a...
SourceID ieee
SourceType Publisher
StartPage 3764
SubjectTerms Cognition
Encoding
Legged locomotion
Planning
Rough surfaces
Surface roughness
Title Linear planning logic: An efficient language and theorem prover for robotic task planning
URI https://ieeexplore.ieee.org/document/6907404
WOSCitedRecordID wos000377221103116&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA9zeNCLH5v4TQ4ezdY2SdN4G8OhIGOIyjyNpHmBIbaj6_z7TdNaFbx4K6E8Qj7e7-V9_B5CV5SKVEkWEWtVRFjKAuJuESdSOPCjIjTS82y_PIjpNJnP5ayDrttaGADwyWcwqD59LN_k6aZylQ39S64i_9wSIq5rtVqtS6mPSzpzISDMWYxNBDMM5PB-_DiqkrjYoBHwq5OKB5LJ3v-msI_63xV5eNZizQHqQHaIdn-QCfbQq3tWumOLV00bIuy12g0eZRg8T4QTjL_ck1hlBtdFjO-4citAgZ35iotc5-4o4VKt31pJffQ8uX0a35GmcQJZOsQuCRchM1bH0jJpOU2tUbGmDqw400wbMBFAmmiInHJJTGhDyqUExjkk3Ghp6BHqZnkGxwjbWNKEUVBA3Q-gEqaEgFiD4alQlJ6gXrVIi1XNjbFo1uf07-EztFPtQ50weI66ZbGBC7SdfpTLdXHpN_QT4FuhnA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA5jCuqLl028mwcfzdY2Sdv4NoZjwzmGTJlPI21OYIjt6Dp_v2laq4IvvpVQDiGX852cy3cQuqE0iKVgHtFaeoTFzCHmFnEiAgN-NHCVsDzbL-NgMgnnczFtoNu6FgYAbPIZdIpPG8tXabwpXGVd-5IryD-3OGOeU1Zr1XqXUhuZNAaDQ5ixGasYpuuI7qj_1CvSuFinEvGrl4qFksH-_yZxgNrfNXl4WqPNIWpAcoT2ftAJttCreViag4tXVSMibPXaHe4lGCxThBGMvxyUWCYKl2WM77hwLECGjQGLszRKzWHCuVy_1ZLa6HlwP-sPSdU6gSwNZueEBy5TOvKFZkJzGmsl_YgauOIsYpEC5QHEYQSeUS-hcrVLuRDAOIeQq0goeoyaSZrACcLaFzRkFCRQ8wPIkMkgAD8CxeNAUnqKWsUiLVYlO8aiWp-zv4ev0c5w9jhejEeTh3O0W-xJmT54gZp5toFLtB1_5Mt1dmU39xN2saTj
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+-+IEEE+International+Conference+on+Robotics+and+Automation&rft.atitle=Linear+planning+logic%3A+An+efficient+language+and+theorem+prover+for+robotic+task+planning&rft.au=Kortik%2C+Sitar&rft.au=Saranli%2C+Uluc&rft.date=2014-05-01&rft.pub=IEEE&rft.issn=1050-4729&rft.spage=3764&rft.epage=3770&rft_id=info:doi/10.1109%2FICRA.2014.6907404&rft.externalDocID=6907404
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1050-4729&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1050-4729&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1050-4729&client=summon