Browse › Computer Vision › RoomEnv-v0 › RoomEnv-v0

RoomEnv-v0 archive 2025-07-28

RoomEnv-v0 Benchmark (RoomEnv-v0)

1 row 1 with code listed 1 metric Dataset page

Syntology Since the archive (Syntology): none placed; no newer paper judged to report on this board so far.

The Room environment - v0

[DOI]

We have released a challenging Gymnasium compatible environment. The best strategy for this environment is to have both episodic and semantic memory systems. See the paper for more information.

Prerequisites

  1. A unix or unix-like x86 machine
  2. python 3.10 or higher.
  3. Running in a virtual environment (e.g., conda, virtualenv, etc.) is highly recommended so that you don't mess up with the system python.
  4. This env is added to the PyPI server. Just run: pip install room-env

Data collection

Data is collected from querying ConceptNet APIs. For simplicity, we only collect triples whose format is (head, atlocation, tail). Here head is one of the 80 MS COCO dataset categories. This was kept in mind so that later on we can use images as well.

If you want to collect the data manually, then run below:

python collect_data.py

How does this environment work?

The Gymnasium-compatible Room environment is one big room with Npeople number of people who can freely move around. Each of them selects one object, among Nobjects, and places it in one of the Nlocations locations. Nagents number of agent(s) are also in this room. They can only observe one human placing an object, one at a time; x(t). At the same time, they are given one question about the location of an object; q(t). x(t) is given as a quadruple, (h(t),r(t),t(t),t), For example, <James’s laptop, atlocation, James’s desk, 42> accounts for an observation where an agent sees James placing his laptop on his desk at t = 42. q(t) is given as a double, (h,r). For example, <Karen’s cat, atlocation> is asking where Karen’s cat is located. If the agent answers the question correctly, it gets a reward of  + 1, and if not, it gets 0.

The reason why the observations and questions are given as RDF-triple-like format is two folds. One is that this structured format is easily readable / writable by both humans and machines. Second is that we can use existing knowledge graphs, such as ConceptNet .

To simplify the environment, the agents themselves are not actually moving, but the room is continuously changing. There are several random factors in this environment to be considered:

  1. With the chance of pcommonsense, a human places an object in a commonsense location (e.g., a laptop on a desk). The commonsense knowledge we use is from ConceptNet. With the chance of 1 − pcommonsense, an object is placed at a non-commonsense random location (e.g., a laptop on the tree).

  2. With the chance of pnew_location, a human changes object location.

  3. With the chance of pnew_object, a human changes his/her object to another one.

  4. With the chance of pswitch_person, two people switch their locations. This is done to mimic an agent moving around the room.

All of the four probabilities account for the Bernoulli distributions.

Consider there is only one agent. Then this is a POMDP, where St = (x(t), q(t)), At = (do something with x(t), answer q(t)), and Rt ∈ {0, 1}.

Currently there is no RL trained for this. We only have some heuristics. Take a look at the paper for more details.

RoomEnv-v0

import gymnasium as gym

env = gym.make("room_env:RoomEnv-v0")
(observation, question), info = env.reset()
rewards = 0

while True:
    (observation, question), reward, done, truncated, info = env.step("This is my answer!")
    rewards += reward
    if done:
        break

print(rewards)

Every time when an agent takes an action, the environment will give you an observation and a question to answer. You can try directly answering the question, such as env.step("This is my answer!"), but a better strategy is to keep the observations in memory systems and take advantage of the current observation and the history of them in the memory systems.

Take a look at this repo for an actual interaction with this environment to learn a policy.

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

  1. Fork the Project
  2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
  3. Run make test && make style && make quality in the root repo directory, to ensure code quality.
  4. Commit your Changes (git commit -m 'Add some AmazingFeature')
  5. Push to the Branch (git push origin feature/AmazingFeature)
  6. Open a Pull Request

Cite our paper

@misc{https://doi.org/10.48550/arxiv.2204.01611,
  doi = {10.48550/ARXIV.2204.01611},
  url = {https://arxiv.org/abs/2204.01611},
  author = {Kim, Taewoon and Cochez, Michael and Francois-Lavet, Vincent and Neerincx,
  Mark and Vossen, Piek},
  keywords = {Artificial Intelligence (cs.AI), FOS: Computer and information sciences,
  FOS: Computer and information sciences},
  title = {A Machine With Human-Like Memory Systems},
  publisher = {arXiv},
  year = {2022},
  copyright = {Creative Commons Attribution 4.0 International}
}

Authors

License

MIT

The archive carries no text for this table; the description above is the archive's text for the task RoomEnv-v0. archive 2025-07-28

Over time archive 2025-07-28

Not inferred: final agent reward. Points are placed at the row's paper date, not an evaluation date; 1 of 1 rows carry one.

The chart needs JavaScript; the table below carries every value.

Results archive 2025-07-28

Archive rows end at the archive snapshot, 2025-07-28: no result published after that date is in this table. Rank is the archive's row order at that snapshot; not re-ranked here. Metric values are the archive's strings. Column headers sort the table in your browser; each row keeps its archive rank.

Paper Code Ran Syntology Report
1 HumemAI-v0-handcrafted-capacity=32 700 – Paper Code 2022 linked, not harvested report

All 1 rows shown. 1 link to a paper page on this site; 0 are marked as using additional training data in the archive. No GitHub stars are tracked; "Code" is the first repository the archive lists for the row. The archive carries no row tags, review links or community-submitted rows for this table; none are shown. archive 2025-07-28

Syntology Ran reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”: of the code samples Syntology harvested from repositories linked to that row's paper (joined by arXiv id), N executed on a synthesized input and U are unverified (harvested, no recorded run). Of the N, C constructed an object rather than computing a result (a part of N, never taken away from it), K ran with no instrument failure (honoured or violated the contract Syntology drafted, or ran with no contract checked) and I are failures of Syntology's instrument, not of the code (a wrong contract draft, or a contract check that could not run). It counts code from repositories linked to that row's paper, not this result: the row's number was not reproduced and nothing here is a correctness claim. The other cell texts mean no graph line for the row: "linked, not harvested" (the archive links code, Syntology has not harvested it), "no code linked" (no code link in the archive), "not matched" (the row's paper URL matched no paper on this site). 0 rows have a graph line, from 0 distinct papers. Rows whose paper has a sample that ran: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument). Papers: 0 with a sample that ran: 0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument. Whose code ran. When the archive marks a repository official for the row's paper, the cell starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code): “official (archive's flag): N ran” counts the samples from it that ran, instrument failures included; “official: harvested, nothing ran”; when it has no sample for this paper and other samples ran, “community repositories only” if every one came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, and “official: no sample here; runs from other or unrecorded repositories” if any came from a repository named in the paper or found in its text by Syntology, or has no repository recorded; “official: harvested for another paper” (no sample from it is linked to this paper) or “official: not harvested”. No state is printed when the archive marks none official. The cell's tooltip names the repositories the samples that ran came from. Of the 0 rows with a graph line, 0 have an archive-official repository: on 0 a sample from it ran (0 with a run with no instrument failure), on 0 the samples that ran came from community repositories only, and on 0 from other or unrecorded repositories. The filters above hide rows and never renumber them; the first two count, by default, only a run with no instrument failure, and offer any run, instrument failures included. Counting each paper once, of 0 samples: 0 ran · 0 unverified. Separately, 0 of those 0 are pointer-only (licence): the site points at that code rather than redistributing it, a licence property recorded for ran and unverified samples alike; each cell's tooltip carries the row's own pointer-only count. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. Per-sample status is on the paper page; each Ran cell links to that paper's sample list. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

Since the archive Syntology

Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), none had this board among the leaderboards the extractor considered for their tables yet (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,596 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), so none await a verdict here. Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections