Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Pedro U. Lima

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Pier Francesco Palamara

> Home > Persons > Pedro U. Lima

Publications

2011
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/aamas/ZiparoILNP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aamas/ZiparoILNP11
Vittorio A. Ziparo, Luca Iocchi, Pedro U. Lima, Daniele Nardi, Pier Francesco Palamara:
Petri Net Plans - A framework for collaboration and coordination in multi-robot systems. Auton. Agents Multi Agent Syst. 23(3): 344-383 (2011)
2008
[c38]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/atal/PalamaraNZLlC08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/PalamaraNZLlC08
Pier Francesco Palamara, Vittorio A. Ziparo, Luca Iocchi, Daniele Nardi, Pedro U. Lima, Hugo Costelha:
A robotic soccer passing task using petri net plans. AAMAS (Demos) 2008: 1711-1712
[c37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/robocup/PalamaraZINL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/robocup/PalamaraZINL08
Pier Francesco Palamara, Vittorio A. Ziparo, Luca Iocchi, Daniele Nardi, Pedro U. Lima:
Teamwork Design Based on Petri Net Plans. RoboCup 2008: 200-211

a service of

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.