-
Notifications
You must be signed in to change notification settings - Fork 0
/
htn_task_descr.cpp
240 lines (208 loc) · 7.62 KB
/
htn_task_descr.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
#include <string>
#include <vector>
#include <sstream>
#include <set>
#include <tr1/memory>
#include "exception.hpp"
#include "funcs.hpp"
#include "term.hpp"
#include "term_string.hpp"
#include "term_constant.hpp"
#include "term_variable.hpp"
#include "type_table.hpp"
#include "substitution.hpp"
#include "formula.hpp"
#include "formula_pred.hpp"
#include "formula_neg.hpp"
#include "formula_conj.hpp"
#include "htn_task_head.hpp"
#include "htn_task_descr.hpp"
/** \file htn_task_descr.hpp
* Declaration of HtnTaskDescr class.
*/
/** \file htn_task_descr.cpp
* Definition of HtnTaskDescr class.
*/
/** \class HtnTaskDescr
* A description of what it means to accomplish a task in an HTN.
* Specifically, what are the conditions necessary to make it possible to
* accomplish the task and what effect will it have?
*/
/** \var HtnTaskDescr::m_pHead
* A smart pointer to the head of the task being described.
*/
/** \var HtnTaskDescr::m_pPreconditions
* A smart pointer to the conditions under which it is possible to accomplish
* the task.
*/
/** \var HtnTaskDescr::m_pEffects
* A smart pointer to the effects that will always result from this task
* being accomplished.
* Depending on the way the task is accomplished, there may be side effects
* as well.
*/
/**
* Construct an HtnTaskDescr from its textual representation and stuff.
* \param p_sInput INOUT A stream containing a textual representation of the
* HtnTaskDescr. The stream is advanced beyond this description.
* \param p_sTypes IN A list of allowable types. If non-empty, all terms
* used must have a type in it. If empty, all terms must be untyped.
* \param p_vAllowablePredicates IN A list of allowable predicate symbols with
* the number and types of their arguments. If non-empty, only these
* predicates may be used. Otherwise, any may be used.
*/
HtnTaskDescr::HtnTaskDescr( std::stringstream & p_sInput,
const std::set< std::string, StrLessNoCase > & p_sTypes,
const std::vector< FormulaPred > & p_vAllowablePredicates )
{
ConstructorInternal( p_sInput, p_sTypes, p_vAllowablePredicates );
}
/**
* Construct an HtnTaskDescr from its textual representation and stuff.
* \param p_sString IN A textual representation of the HtnTaskDescr.
* \param p_sTypes IN A list of allowable types. If non-empty, all terms
* used must have a type in it. If empty, all terms must be untyped.
* \param p_vAllowablePredicates IN A list of allowable predicate symbols with
* the number and types of their arguments. If non-empty, only these
* predicates may be used. Otherwise, any may be used.
*/
HtnTaskDescr::HtnTaskDescr( std::string p_sString,
const std::set< std::string, StrLessNoCase > & p_sTypes,
const std::vector< FormulaPred > & p_vAllowablePredicates )
{
std::stringstream l_sInput( p_sString );
ConstructorInternal( l_sInput, p_sTypes, p_vAllowablePredicates );
}
/**
* Construct an HtnTaskDescr as a copy of an existing one.
* \param p_Other IN The HtnTaskDescr to copy.
*/
HtnTaskDescr::HtnTaskDescr( const HtnTaskDescr & p_Other )
{
}
/**
* Destruct this HtnTaskDescr.
*/
HtnTaskDescr::~HtnTaskDescr()
{
}
/**
* Construct an HtnTaskDescr from its textual representation and stuff.
* \param p_sInput INOUT A stream containing a textual representation of the
* HtnTaskDescr. The stream is advanced beyond this description.
* \param p_sTypes IN A list of allowable types. If non-empty, all terms
* used must have a type in it. If empty, all terms must be untyped.
* \param p_vAllowablePredicates IN A list of allowable predicate symbols with
* the number and types of their arguments. If non-empty, only these
* predicates may be used. Otherwise, any may be used.
*/
void HtnTaskDescr::ConstructorInternal( std::stringstream & p_sInput,
const std::set< std::string, StrLessNoCase > & p_sTypes,
const std::vector< FormulaPred > & p_vAllowablePredicates )
{
TypeTable l_TypeTable;
EatWhitespace( p_sInput );
EatString( p_sInput, "(" );
EatWhitespace( p_sInput );
EatString( p_sInput, ":task" );
EatWhitespace( p_sInput );
std::string l_sHead = "( ";
l_sHead += ReadString( p_sInput );
EatWhitespace( p_sInput );
EatString( p_sInput, ":parameters" );
EatWhitespace( p_sInput );
EatString( p_sInput, "(" );
EatWhitespace( p_sInput );
while( p_sInput.peek() != ')' )
{
std::string l_sName = ReadString( p_sInput );
l_sHead += " " + l_sName;
if( p_sTypes.size() > 0 )
{
EatWhitespace( p_sInput );
EatString( p_sInput, "-" );
EatWhitespace( p_sInput );
std::string l_sTyping = ReadString( p_sInput );
if( p_sTypes.find( l_sTyping ) == p_sTypes.end() )
throw Exception( E_NOT_IMPLEMENTED,
"Attempt to use an unregistered type.",
__FILE__,
__LINE__ );
if( l_TypeTable.find( l_sName ) != l_TypeTable.end() )
{
if( CompareNoCase( (*l_TypeTable.find( l_sName )).second, l_sTyping ) == 0 )
throw Exception( E_NOT_IMPLEMENTED,
"Attempt to use a term with multiple types.",
__FILE__,
__LINE__ );
}
else
l_TypeTable[l_sName] = l_sTyping;
}
EatWhitespace( p_sInput );
}
l_sHead += " )";
m_pHead = HtnTaskHeadP( new HtnTaskHead( l_sHead, l_TypeTable ) );
EatString( p_sInput, ")" );
EatWhitespace( p_sInput );
EatString( p_sInput, ":precondition" );
EatWhitespace( p_sInput );
m_pPreconditions = FormulaConjP( new FormulaConj( p_sInput, l_TypeTable, p_vAllowablePredicates ) );
EatWhitespace( p_sInput );
EatString( p_sInput, ":effect" );
EatWhitespace( p_sInput );
m_pEffects = FormulaConjP( new FormulaConj( p_sInput, l_TypeTable, p_vAllowablePredicates ) );
EatWhitespace( p_sInput );
EatString( p_sInput, ")" );
}
/**
* Retrieve a smart pointer to the head of this HtnTaskDescr.
* \return A smart pointer to the head of this HtnTaskDescr.
*/
HtnTaskHeadP HtnTaskDescr::GetCHead() const
{
return m_pHead;
}
/**
* Retrieve a smart pointer to the preconditions of this HtnTaskDescr.
* \return A smart pointer to the preconditions of this HtnTaskDescr.
*/
FormulaConjP HtnTaskDescr::GetCPreconditions() const
{
return m_pPreconditions;
}
/**
* Retrieve a smart pointer to the effects of this HtnTaskDescr.
* \return A smart pointer to the effects of this HtnTaskDescr.
*/
FormulaConjP HtnTaskDescr::GetCEffects() const
{
return m_pEffects;
}
/**
* Retrieve a smart pointer to a new HtnTaskDescr that results from applying a
* Substitution to this one.
* \param p_Sub IN The Substitution to apply.
* \param p_iRecurseLevel IN The depth of this Substitution attempt.
* \return A smart pointer to a new HtnTaskDescr that results from applying
* the given Substitution to this one.
*/
std::tr1::shared_ptr< HtnTaskDescr > HtnTaskDescr::AfterSubstitution( const Substitution & p_Sub,
unsigned int p_iRecurseLevel) const
{
HtnTaskDescr * l_pRet = new HtnTaskDescr( *this );
l_pRet->m_pHead = std::tr1::dynamic_pointer_cast< HtnTaskHead >( m_pHead->AfterSubstitution( p_Sub, p_iRecurseLevel ) );
l_pRet->m_pPreconditions = std::tr1::dynamic_pointer_cast< FormulaConj >( m_pPreconditions->AfterSubstitution( p_Sub, p_iRecurseLevel ) );
l_pRet->m_pEffects = std::tr1::dynamic_pointer_cast< FormulaConj >( m_pEffects->AfterSubstitution( p_Sub, p_iRecurseLevel ) );
return std::tr1::shared_ptr< HtnTaskDescr >( l_pRet );
}
size_t HtnTaskDescr::GetMemSizeMin() const
{
size_t l_iSize = sizeof( HtnTaskDescr );
return l_iSize;
}
size_t HtnTaskDescr::GetMemSizeMax() const
{
size_t l_iSize = sizeof( HtnTaskDescr ) + m_pHead->GetMemSizeMax() + m_pPreconditions->GetMemSizeMax() + m_pEffects->GetMemSizeMax();
return l_iSize;
}