◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Oren Salzman

13 papers hereh-index 5161 citations13 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • middle author5
  • last author6

Across the 12 of 13 papers where every author was matched, so the position is known.

fields
  • cs.RO7
  • cs.AI3
  • cs.MA3
same name
  • Oren Salzman — 27 papers, h 19
  • Oren Salzman — 12 papers, h 8
  • Oren Salzman — 8 papers, h 7
  • Oren Salzman — 3 papers, h 3
  • Oren Salzman — 1 paper
  • Oren Salzman — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20212026
most citedLeveraging Experience in Lifelong Multi-Agent Pathfinding

4 citations · 5 across the 11 of their papers we have counts for

collaborators
Showing 2026Show all

4 papers · 1 filter

cs.AI2026

Divide and Collapse: MAPF-Collapse via Exact Decomposition into Independent Sub-Instances

Oren Salzman

In this work we study the problem of MAPFC, a post-optimization step for Multi-Agent Path Finding (MAPF) plans where we are given a feasible plan produced by a modern MAPF solver a…

cs.RO2026

Inspection-SPARS: Task-Oriented Sparse Roadmaps for Inspection Planning

Adir Morgan, Oren Salzman, Kiril Solovey

Inspection planning seeks a minimum-length collision-free robot tour that observes a given set of points of interest (POIs). Sampling-based methods reduce this continuous problem t…

cs.RO2026

Bidirectional Incremental Generalized Hybrid A*

Sidharth Talia, Oren Salzman, Siddhartha Srinivasa

We focus on the problem of efficient anytime kinodynamic planning for systems with complex dynamics in unstructured environments that make using precomputed motion primitives infea…

cs.RO2026

Scalable Inspection Planning via Flow-based Mixed Integer Linear Programming

Adir Morgan, Kiril Solovey, Oren Salzman

Inspection planning is concerned with computing the shortest robot path to inspect a given set of points of interest (POIs) using the robot's sensors. This problem arises in a wide…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.