Coder Social home page Coder Social logo

rhcr's People

Contributors

jiaoyang-li avatar

Stargazers

avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar

Watchers

avatar avatar avatar

Forkers

mmehrez jian-dong albaintelligence kkt474 111116 eli-b gamemonkey kumarganduri ranulfobezerra qwerty35 alejandropenacho meetyyj derweeyang gaosz0755 qhb98 lvyv aandreychuk rsobt klyuchnikova cshr25 leonpan1 justinrochester joonyeol-sim seraphli nobodyczcz yangda75 harukimoriarty bingyingl jxlgzwh vineettambe hoshianaaa pscheffe diligentpanda justinshetty

rhcr's Issues

Problem：Program received signal SIGSEGV, Segmentation fault.

Hello,

I met an issue: "Program received signal SIGSEGV, Segmentation fault" when I tried to use WHCA or LRA solver. (My used command is "./lifelong -m maps/kiva.map -k 100 --scenario=KIVA --solver=WHCA". I don't know what happened, was that a pointer problem?

Can you help me? Thank you very much!!!

image

Question about `move()` in BasicSystem.cpp

Dear Professor Li,

Thank you for this fantastic algorithm.

I have a question regarding this

RHCR/src/BasicSystem.cpp

Line 362 in fa0aea7

if ((!hold_endpoints || paths[k].size() == t + 1) && !goal_locations[k].empty() &&
if statement. It seems that you only remove the finished goal from the goal_locations vector when that goal is finished at the end of a path by using the condition paths[k].size() == t + 1.

I am confused about this condition, because if an agent reaches two goals within one newly added path, then the goal location of the first accomplished path will not be removed.

Could you please shed some light on this issue? Thank you so much for your time and attention to this problem.

Best regards,

Jp

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.