/
RobotContext.cpp
1597 lines (1413 loc) · 45.9 KB
/
RobotContext.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (C) 2020 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#include "internal_RobotUpdateHandle.hpp"
#include <rmf_traffic_ros2/Time.hpp>
#include <rmf_traffic/schedule/StubbornNegotiator.hpp>
#include <rmf_fleet_msgs/msg/robot_mode.hpp>
#include <rmf_door_msgs/msg/door_mode.hpp>
#include <rmf_utils/math.hpp>
namespace rmf_fleet_adapter {
namespace agv {
//==============================================================================
void NavParams::search_for_location(
const std::string& map,
Eigen::Vector3d position,
RobotContext& context)
{
auto planner = context.planner();
if (!planner)
{
RCLCPP_ERROR(
context.node()->get_logger(),
"Planner unavailable for robot [%s], cannot update its location",
context.requester_id().c_str());
return;
}
const auto& graph = planner->get_configuration().graph();
const auto now = context.now();
auto starts = compute_plan_starts(graph, map, position, now);
if (!starts.empty())
{
if (context.debug_positions)
{
std::stringstream ss;
ss << __FILE__ << "|" << __LINE__ << ": " << starts.size()
<< " starts:" << print_starts(starts, graph);
std::cout << ss.str() << std::endl;
}
context.set_location(std::move(starts));
}
else
{
if (context.debug_positions)
{
std::cout << __FILE__ << "|" << __LINE__ << ": setting robot to LOST | "
<< map << " <" << position.block<2, 1>(0, 0).transpose()
<< "> orientation " << position[2] * 180.0 / M_PI << std::endl;
}
context.set_lost(Location { now, map, position });
}
}
//==============================================================================
void NavParams::find_stacked_vertices(const rmf_traffic::agv::Graph& graph)
{
for (std::size_t i = 0; i < graph.num_waypoints() - 1; ++i)
{
const auto& wp_i = graph.get_waypoint(i);
const Eigen::Vector2d p_i = wp_i.get_location();
const std::string& map_i = wp_i.get_map_name();
for (std::size_t j = i+1; j < graph.num_waypoints(); ++j)
{
const auto& wp_j = graph.get_waypoint(j);
const Eigen::Vector2d p_j = wp_j.get_location();
const std::string& map_j = wp_j.get_map_name();
if (map_i != map_j)
{
continue;
}
const double dist = (p_i - p_j).norm();
if (dist > max_merge_waypoint_distance)
{
continue;
}
// stack these waypoints
auto stack_i = stacked_vertices[i];
auto stack_j = stacked_vertices[j];
if (!stack_i && !stack_j)
{
// create a new stack
stack_i = std::make_shared<std::unordered_set<std::size_t>>();
stack_j = stack_i;
}
else if (stack_i && stack_j)
{
if (stack_i != stack_j)
{
for (const std::size_t other : *stack_j)
{
stack_i->insert(other);
stacked_vertices[other] = stack_i;
}
}
}
else if (!stack_i)
{
stack_i = stack_j;
}
assert(stack_i);
stack_i->insert(i);
stack_i->insert(j);
stacked_vertices[i] = stack_i;
stacked_vertices[j] = stack_j;
}
}
}
//==============================================================================
std::string NavParams::get_vertex_name(
const rmf_traffic::agv::Graph& graph,
const std::optional<std::size_t> v_opt) const
{
if (!v_opt.has_value())
return "";
const std::size_t v = v_opt.value();
if (const std::string* n = graph.get_waypoint(v).name())
{
return *n;
}
else
{
const auto& stack_it = stacked_vertices.find(v);
if (stack_it != stacked_vertices.end() && stack_it->second)
{
for (const auto& v : *stack_it->second)
{
if (const auto* n = graph.get_waypoint(v).name())
{
return *n;
}
}
}
}
return "";
}
//==============================================================================
rmf_traffic::agv::Plan::StartSet NavParams::process_locations(
const rmf_traffic::agv::Graph& graph,
rmf_traffic::agv::Plan::StartSet locations) const
{
return _lift_boundary_filter(graph, _descend_stacks(graph, locations));
}
//==============================================================================
rmf_traffic::agv::Plan::StartSet NavParams::_descend_stacks(
const rmf_traffic::agv::Graph& graph,
rmf_traffic::agv::Plan::StartSet locations) const
{
std::vector<std::size_t> remove;
for (std::size_t i = 0; i < locations.size(); ++i)
{
rmf_traffic::agv::Plan::Start& location = locations[i];
std::optional<std::size_t> waypoint_opt;
if (location.lane().has_value())
{
const rmf_traffic::agv::Graph::Lane& lane =
graph.get_lane(*location.lane());
waypoint_opt = lane.entry().waypoint_index();
}
else
{
waypoint_opt = location.waypoint();
}
if (!waypoint_opt.has_value())
continue;
const std::size_t original_waypoint = waypoint_opt.value();
std::size_t waypoint = original_waypoint;
const auto s_it = stacked_vertices.find(waypoint);
VertexStack stack;
if (s_it != stacked_vertices.end())
stack = s_it->second;
if (!stack)
continue;
std::unordered_set<std::size_t> visited;
bool can_descend = true;
bool has_loop = false;
while (can_descend)
{
can_descend = false;
if (!visited.insert(waypoint).second)
{
// These stacked vertices have a loop so there's no way to find a bottom
// for it. We need to just exit here.
has_loop = true;
break;
}
for (std::size_t v : *stack)
{
if (graph.lane_from(v, waypoint))
{
waypoint = v;
can_descend = true;
break;
}
}
}
if (has_loop)
{
continue;
}
// Transfer the location estimate over to the waypoint that's at the bottom
// of the vertex stack.
if (waypoint != original_waypoint)
{
bool can_merge = true;
if (const auto r_merge = graph.get_waypoint(waypoint).merge_radius())
{
if (const auto p_opt = location.location())
{
const auto p = p_opt.value();
const auto p_wp = graph.get_waypoint(waypoint).get_location();
if ((p - p_wp).norm() > r_merge)
{
can_merge = false;
remove.push_back(i);
}
}
}
if (can_merge)
{
location.lane(std::nullopt);
location.waypoint(waypoint);
}
}
}
for (auto r_it = remove.rbegin(); r_it != remove.rend(); ++r_it)
{
locations.erase(locations.begin() + *r_it);
}
return locations;
}
//==============================================================================
rmf_traffic::agv::Plan::StartSet NavParams::_lift_boundary_filter(
const rmf_traffic::agv::Graph& graph,
rmf_traffic::agv::Plan::StartSet locations) const
{
const auto r_it = std::remove_if(
locations.begin(),
locations.end(),
[&graph](const rmf_traffic::agv::Plan::Start& location)
{
if (location.lane().has_value())
{
// If the intention is to move along a lane, then it is okay to keep
// this. If the lane is entering or exiting the lift, then it should
// have the necessary events.
// TODO(@mxgrey): Should we check and make sure that the event is
// actually present?
return false;
}
if (!location.location().has_value())
{
// If the robot is perfectly on some waypoint then there is no need to
// filter.
return false;
}
const Eigen::Vector2d p = location.location().value();
const auto robot_inside_lift = [&]()
-> rmf_traffic::agv::Graph::LiftPropertiesPtr
{
for (const auto& lift : graph.all_known_lifts())
{
// We assume lifts never overlap so we will return the first
// positive hit.
if (lift->is_in_lift(p))
return lift;
}
return nullptr;
}();
const auto& wp = graph.get_waypoint(location.waypoint());
const auto lift = wp.in_lift();
// If the robot's lift status and the waypoint's lift status don't match
// then we should filter this waypoint out.
return wp.in_lift() != robot_inside_lift;
});
locations.erase(r_it, locations.end());
return locations;
}
//==============================================================================
bool NavParams::in_same_stack(
std::size_t wp0,
std::size_t wp1) const
{
if (wp0 == wp1)
{
return true;
}
const auto s_it = stacked_vertices.find(wp0);
if (s_it == stacked_vertices.end())
return false;
const auto stack = s_it->second;
if (!stack)
return false;
return stack->count(wp1);
}
//==============================================================================
std::shared_ptr<RobotCommandHandle> RobotContext::command()
{
return _command_handle.lock();
}
//==============================================================================
std::shared_ptr<RobotUpdateHandle> RobotContext::make_updater()
{
return RobotUpdateHandle::Implementation::make(shared_from_this());
}
//==============================================================================
Eigen::Vector3d RobotContext::position() const
{
if (!_location.empty())
{
const auto& l = _location.front();
if (l.location().has_value())
{
const Eigen::Vector2d& p = *l.location();
return {p[0], p[1], l.orientation()};
}
const Eigen::Vector2d& p =
navigation_graph().get_waypoint(l.waypoint()).get_location();
return {p[0], p[1], l.orientation()};
}
else if (_lost.has_value() && _lost->location.has_value())
{
return _lost->location->position;
}
throw std::runtime_error(
"No location information is available for [" + requester_id() + "]");
}
//==============================================================================
const std::string& RobotContext::map() const
{
if (!_location.empty())
{
return navigation_graph()
.get_waypoint(_location.front().waypoint()).get_map_name();
}
else if (_lost.has_value() && _lost->location.has_value())
{
return _lost->location->map;
}
throw std::runtime_error(
"No location information is available for [" + requester_id() + "]");
}
//==============================================================================
rmf_traffic::Time RobotContext::now() const
{
return rmf_traffic_ros2::convert(_node->now());
}
//==============================================================================
std::function<rmf_traffic::Time()> RobotContext::clock() const
{
return [self = shared_from_this()]() { return self->now(); };
}
//==============================================================================
const rmf_traffic::agv::Plan::StartSet& RobotContext::location() const
{
return _location;
}
//==============================================================================
void RobotContext::set_location(rmf_traffic::agv::Plan::StartSet location_)
{
for (auto& location : location_)
{
location.orientation(rmf_utils::wrap_to_pi(location.orientation()));
}
_location = std::move(location_);
filter_closed_lanes();
if (_location.empty())
{
if (debug_positions)
{
std::cout << __FILE__ << "|" << __LINE__ << ": setting robot to LOST" <<
std::endl;
}
set_lost(std::nullopt);
return;
}
else if (_lost)
{
nlohmann::json resolve;
resolve["robot"] = name();
resolve["group"] = group();
resolve["msg"] = "The robot [" + requester_id() + "] has found a "
"connection to the navigation graph.";
_lost->ticket->resolve(resolve);
_lost = std::nullopt;
// If the robot has switched from lost to found, we should go ahead and
// replan.
RCLCPP_INFO(
node()->get_logger(),
"Requesting a replan for [%s] because it has been found after being lost",
requester_id().c_str());
request_replan();
}
_most_recent_valid_location = _location;
}
//==============================================================================
const std::optional<Lost>& RobotContext::lost() const
{
return _lost;
}
//==============================================================================
void RobotContext::set_lost(std::optional<Location> location)
{
_location.clear();
if (!_lost.has_value())
{
nlohmann::json detail;
detail["robot"] = name();
detail["group"] = group();
detail["msg"] = "The robot [" + requester_id() + "] is too far from the "
"navigation graph and may need an operator to help bring it back.";
auto ticket = _reporting.create_issue(
rmf_task::Log::Tier::Error, "lost", detail);
_lost = Lost { location, std::move(ticket) };
}
else
{
_lost->location = location;
}
}
//==============================================================================
void RobotContext::filter_closed_lanes()
{
const rmf_traffic::agv::LaneClosure* closures = get_lane_closures();
if (closures)
{
for (std::size_t i = 0; i < _location.size(); )
{
if (_location[i].lane().has_value())
{
if (closures->is_closed(*_location[i].lane()))
{
_location.erase(_location.begin() + i);
continue;
}
}
++i;
}
}
}
//==============================================================================
const rmf_traffic::agv::LaneClosure* RobotContext::get_lane_closures() const
{
if (_emergency)
{
if (const auto planner = *_emergency_planner)
{
return &planner->get_configuration().lane_closures();
}
}
else
{
if (const auto planner = *_planner)
{
return &planner->get_configuration().lane_closures();
}
}
return nullptr;
}
//==============================================================================
rmf_traffic::schedule::Participant& RobotContext::itinerary()
{
return _itinerary;
}
//==============================================================================
const rmf_traffic::schedule::Participant& RobotContext::itinerary() const
{
return _itinerary;
}
//==============================================================================
auto RobotContext::schedule() const -> const std::shared_ptr<const Mirror>&
{
return _schedule;
}
//==============================================================================
const rmf_traffic::schedule::ParticipantDescription&
RobotContext::description() const
{
return _itinerary.description();
}
//==============================================================================
const std::shared_ptr<const rmf_traffic::Profile>& RobotContext::profile() const
{
return _profile;
}
//==============================================================================
const std::string& RobotContext::name() const
{
return _itinerary.description().name();
}
//==============================================================================
const std::string& RobotContext::group() const
{
return _itinerary.description().owner();
}
//==============================================================================
const std::string& RobotContext::requester_id() const
{
return _requester_id;
}
//==============================================================================
rmf_traffic::ParticipantId RobotContext::participant_id() const
{
return _itinerary.id();
}
//==============================================================================
const rmf_traffic::agv::Graph& RobotContext::navigation_graph() const
{
return (*_planner)->get_configuration().graph();
}
//==============================================================================
const std::shared_ptr<const rmf_traffic::agv::Planner>&
RobotContext::planner() const
{
return *_planner;
}
//==============================================================================
const std::shared_ptr<const rmf_traffic::agv::Planner>&
RobotContext::emergency_planner() const
{
return *_emergency_planner;
}
//==============================================================================
std::shared_ptr<NavParams> RobotContext::nav_params() const
{
return _nav_params;
}
//==============================================================================
void RobotContext::set_nav_params(std::shared_ptr<NavParams> value)
{
_nav_params = std::move(value);
}
//==============================================================================
class RobotContext::NegotiatorLicense
{
public:
NegotiatorLicense(
std::shared_ptr<RobotContext> context,
rmf_traffic::schedule::Negotiator* negotiator)
: _context(context),
_negotiator(negotiator)
{
// Do nothing
}
~NegotiatorLicense()
{
const auto context = _context.lock();
if (!context)
return;
if (context && context->_negotiator == _negotiator)
context->_negotiator = nullptr;
}
private:
std::weak_ptr<RobotContext> _context;
rmf_traffic::schedule::Negotiator* _negotiator;
};
//==============================================================================
auto RobotContext::set_negotiator(
rmf_traffic::schedule::Negotiator* negotiator)
-> std::shared_ptr<NegotiatorLicense>
{
_negotiator = negotiator;
return std::make_shared<NegotiatorLicense>(
shared_from_this(), negotiator);
}
//==============================================================================
std::shared_ptr<void> RobotContext::be_stubborn()
{
return _stubbornness;
}
//==============================================================================
bool RobotContext::is_stubborn() const
{
return _stubbornness.use_count() > 1;
}
//==============================================================================
const rxcpp::observable<RobotContext::Empty>&
RobotContext::observe_replan_request() const
{
return _replan_obs;
}
//==============================================================================
const rxcpp::observable<RobotContext::Empty>&
RobotContext::observe_charging_change() const
{
return _charging_change_obs;
}
//==============================================================================
void RobotContext::request_replan()
{
_replan_publisher.get_subscriber().on_next(Empty{});
}
//==============================================================================
const rxcpp::observable<RobotContext::GraphChange>&
RobotContext::observe_graph_change() const
{
return _graph_change_obs;
}
//==============================================================================
void RobotContext::notify_graph_change(GraphChange changes)
{
filter_closed_lanes();
_graph_change_publisher.get_subscriber().on_next(std::move(changes));
}
//==============================================================================
const std::shared_ptr<rmf_fleet_adapter::agv::Node>& RobotContext::node()
{
return _node;
}
//==============================================================================
std::shared_ptr<const Node> RobotContext::node() const
{
return _node;
}
//==============================================================================
const rxcpp::schedulers::worker& RobotContext::worker() const
{
return _worker;
}
//==============================================================================
rmf_utils::optional<rmf_traffic::Duration> RobotContext::maximum_delay() const
{
return _maximum_delay;
}
//==============================================================================
RobotContext& RobotContext::maximum_delay(
rmf_utils::optional<rmf_traffic::Duration> value)
{
_maximum_delay = value;
return *this;
}
//==============================================================================
const rmf_task::ConstActivatorPtr& RobotContext::task_activator() const
{
return _task_activator;
}
//==============================================================================
const rmf_task::ConstParametersPtr& RobotContext::task_parameters() const
{
return _task_parameters;
}
//==============================================================================
const rmf_task::State& RobotContext::current_task_end_state() const
{
return _current_task_end_state;
}
//==============================================================================
RobotContext& RobotContext::current_task_end_state(
const rmf_task::State& state)
{
_current_task_end_state = state;
return *this;
}
//==============================================================================
std::function<rmf_task::State()> RobotContext::make_get_state()
{
return [self = shared_from_this()]()
{
if (self->_most_recent_valid_location.empty())
{
throw std::runtime_error(
"Missing a _most_recent_valid_location for robot ["
+ self->requester_id() + "]. This is an internal RMF error, "
"please report it to the RMF developers.");
}
rmf_task::State state;
state.load_basic(
self->_most_recent_valid_location.front(),
self->_charging_wp,
self->_current_battery_soc);
state.insert<GetContext>(GetContext{self->shared_from_this()});
return state;
};
}
//==============================================================================
const std::string* RobotContext::current_task_id() const
{
if (_current_task_id.has_value())
return &(*_current_task_id);
return nullptr;
}
//==============================================================================
RobotContext& RobotContext::current_task_id(std::optional<std::string> id)
{
std::unique_lock<std::mutex> lock(*_current_task_id_mutex);
_current_task_id = std::move(id);
_initial_time_idle_outside_lift = std::nullopt;
return *this;
}
//==============================================================================
std::string RobotContext::copy_current_task_id() const
{
std::unique_lock<std::mutex> lock(*_current_task_id_mutex);
if (_current_task_id.has_value())
return _current_task_id.value();
return {};
}
//==============================================================================
double RobotContext::current_battery_soc() const
{
return _current_battery_soc;
}
//==============================================================================
RobotContext& RobotContext::current_battery_soc(const double battery_soc)
{
if (battery_soc < 0.0 || battery_soc > 1.0)
{
RCLCPP_ERROR(
_node->get_logger(),
"Invalid battery state of charge given for [%s]: %0.3f",
requester_id().c_str(),
battery_soc);
return *this;
}
_current_battery_soc = battery_soc;
_battery_soc_publisher.get_subscriber().on_next(battery_soc);
return *this;
}
//==============================================================================
std::size_t RobotContext::dedicated_charging_wp() const
{
return _charging_wp;
}
//==============================================================================
bool RobotContext::waiting_for_charger() const
{
return _waiting_for_charger;
}
//==============================================================================
const rxcpp::observable<double>& RobotContext::observe_battery_soc() const
{
return _battery_soc_obs;
}
//==============================================================================
const std::shared_ptr<const rmf_task::TaskPlanner>&
RobotContext::task_planner() const
{
return _task_planner;
}
//==============================================================================
auto RobotContext::task_planner(
const std::shared_ptr<const rmf_task::TaskPlanner> task_planner)
-> RobotContext&
{
_task_planner = task_planner;
return *this;
}
//==============================================================================
void RobotContext::set_lift_entry_watchdog(
RobotUpdateHandle::Unstable::Watchdog watchdog,
rmf_traffic::Duration wait_duration)
{
_lift_watchdog = std::move(watchdog);
_lift_rewait_duration = wait_duration;
}
//==============================================================================
const RobotUpdateHandle::Unstable::Watchdog&
RobotContext::get_lift_watchdog() const
{
return _lift_watchdog;
}
//==============================================================================
rmf_traffic::Duration RobotContext::get_lift_rewait_duration() const
{
return _lift_rewait_duration;
}
//==============================================================================
void RobotContext::respond(
const TableViewerPtr& table_viewer,
const ResponderPtr& responder)
{
if (_negotiator && !is_stubborn())
return _negotiator->respond(table_viewer, responder);
// If there is no negotiator assigned for this robot or the stubborn mode has
// been requested, then use a StubbornNegotiator.
//
// TODO(MXG): Consider if this should be scheduled on a separate thread
// instead of executed immediately. The StubbornNegotiator doesn't do any
// planning, so it should be able to finish quickly, but that should be
// verified with benchmarks.
rmf_traffic::schedule::StubbornNegotiator(_itinerary).respond(
table_viewer, responder);
}
//==============================================================================
void RobotContext::current_mode(uint32_t mode)
{
_current_mode = mode;
}
//==============================================================================
uint32_t RobotContext::current_mode() const
{
return _current_mode;
}
//==============================================================================
void RobotContext::override_status(std::optional<std::string> status)
{
_override_status = status;
}
//==============================================================================
std::optional<std::string> RobotContext::override_status() const
{
return _override_status;
}
//==============================================================================
void RobotContext::action_executor(
RobotUpdateHandle::ActionExecutor action_executor)
{
if (action_executor == nullptr)
{
RCLCPP_WARN(
_node->get_logger(),
"ActionExecutor set to nullptr for robot [%s]. If this robot needs to "
"perform an action as part of a task, a critical task error will be "
"thrown.",
this->name().c_str());
}
_action_executor = action_executor;
}
//==============================================================================
RobotUpdateHandle::ActionExecutor RobotContext::action_executor() const
{
return _action_executor;
}
//==============================================================================
std::shared_ptr<TaskManager> RobotContext::task_manager()
{
return _task_manager.lock();
}
//==============================================================================
bool RobotContext::is_commissioned() const
{
return _commissioned;
}
//==============================================================================
void RobotContext::decommission()
{
_commissioned = false;
}
//==============================================================================
void RobotContext::recommission()
{
_commissioned = true;
}
//==============================================================================
Reporting& RobotContext::reporting()
{
return _reporting;
}
//==============================================================================
const Reporting& RobotContext::reporting() const
{
return _reporting;
}
//==============================================================================
bool RobotContext::localize(
EasyFullControl::Destination estimate,
EasyFullControl::CommandExecution execution) const
{
if (_localize)
{
_localize(std::move(estimate), std::move(execution));