Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Francesco Riccio

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 Guglielmo Gemignani

> Home > Persons > Francesco Riccio

Publications

2016
[c8]
- view
  - electronic edition @ aaai.org (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/aaai/CapobiancoGINRV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/CapobiancoGINRV16
Roberto Capobianco, Guglielmo Gemignani, Luca Iocchi, Daniele Nardi, Francesco Riccio, Andrea Vanzo:
Contexts for Symbiotic Autonomy: Semantic Mapping, Task Teaching and Social Robotics. AAAI Workshop: Symbiotic Cognitive Systems 2016
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/iros/RiccioBGN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iros/RiccioBGN16
Francesco Riccio, Emanuele Borzi, Guglielmo Gemignani, Daniele Nardi:
Multi-robot search for a moving target: Integrating world modeling, task assignment and context. IROS 2016: 1879-1886
2015
[c2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/robocup/RiccioBGN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/robocup/RiccioBGN15
Francesco Riccio, Emanuele Borzi, Guglielmo Gemignani, Daniele Nardi:
Context-Based Coordination for a Multi-Robot Soccer Team. RoboCup 2015: 276-289

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.